Mercurial > dropbear

comparison libtommath/tommath_superclass.h @ 1739:13d834efc376 fuzz

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
merge from main
author Matt Johnston <matt@ucc.asn.au>
date Thu, 15 Oct 2020 19:55:15 +0800
parents 1051e4eea25a
children
comparison
equal deleted inserted replaced
1562:768ebf737aa0 1739:13d834efc376
1 /* LibTomMath, multiple-precision integer library -- Tom St Denis */
2 /* SPDX-License-Identifier: Unlicense */
3
1 /* super class file for PK algos */ 4 /* super class file for PK algos */
2 5
3 /* default ... include all MPI */ 6 /* default ... include all MPI */
7 #ifndef LTM_NOTHING
4 #define LTM_ALL 8 #define LTM_ALL
9 #endif
5 10
6 /* RSA only (does not support DH/DSA/ECC) */ 11 /* RSA only (does not support DH/DSA/ECC) */
7 /* #define SC_RSA_1 */ 12 /* #define SC_RSA_1 */
13 /* #define SC_RSA_1_WITH_TESTS */
8 14
9 /* For reference.... On an Athlon64 optimizing for speed... 15 /* For reference.... On an Athlon64 optimizing for speed...
10 16
11 LTM's mpi.o with all functions [striped] is 142KiB in size. 17 LTM's mpi.o with all functions [striped] is 142KiB in size.
12 18
13 */ 19 */
14 20
15 /* Works for RSA only, mpi.o is 68KiB */ 21 #ifdef SC_RSA_1_WITH_TESTS
16 #ifdef SC_RSA_1 22 # define BN_MP_ERROR_TO_STRING_C
17 #define BN_MP_SHRINK_C 23 # define BN_MP_FREAD_C
18 #define BN_MP_LCM_C 24 # define BN_MP_FWRITE_C
19 #define BN_MP_PRIME_RANDOM_EX_C 25 # define BN_MP_INCR_C
20 #define BN_MP_INVMOD_C 26 # define BN_MP_ISEVEN_C
21 #define BN_MP_GCD_C 27 # define BN_MP_ISODD_C
22 #define BN_MP_MOD_C 28 # define BN_MP_NEG_C
23 #define BN_MP_MULMOD_C 29 # define BN_MP_PRIME_FROBENIUS_UNDERWOOD_C
24 #define BN_MP_ADDMOD_C 30 # define BN_MP_RADIX_SIZE_C
25 #define BN_MP_EXPTMOD_C 31 # define BN_MP_RAND_C
26 #define BN_MP_SET_INT_C 32 # define BN_MP_REDUCE_C
27 #define BN_MP_INIT_MULTI_C 33 # define BN_MP_REDUCE_2K_L_C
28 #define BN_MP_CLEAR_MULTI_C 34 # define BN_MP_FROM_SBIN_C
29 #define BN_MP_UNSIGNED_BIN_SIZE_C 35 # define BN_MP_ROOT_U32_C
30 #define BN_MP_TO_UNSIGNED_BIN_C 36 # define BN_MP_SET_L_C
31 #define BN_MP_MOD_D_C 37 # define BN_MP_SET_UL_C
32 #define BN_MP_PRIME_RABIN_MILLER_TRIALS_C 38 # define BN_MP_SBIN_SIZE_C
33 #define BN_REVERSE_C 39 # define BN_MP_TO_RADIX_C
34 #define BN_PRIME_TAB_C 40 # define BN_MP_TO_SBIN_C
35 41 # define BN_S_MP_RAND_JENKINS_C
36 /* other modifiers */ 42 # define BN_S_MP_RAND_PLATFORM_C
37 #define BN_MP_DIV_SMALL /* Slower division, not critical */
38
39 /* here we are on the last pass so we turn things off. The functions classes are still there
40 * but we remove them specifically from the build. This also invokes tweaks in functions
41 * like removing support for even moduli, etc...
42 */
43 #ifdef LTM_LAST
44 #undef BN_MP_TOOM_MUL_C
45 #undef BN_MP_TOOM_SQR_C
46 #undef BN_MP_KARATSUBA_MUL_C
47 #undef BN_MP_KARATSUBA_SQR_C
48 #undef BN_MP_REDUCE_C
49 #undef BN_MP_REDUCE_SETUP_C
50 #undef BN_MP_DR_IS_MODULUS_C
51 #undef BN_MP_DR_SETUP_C
52 #undef BN_MP_DR_REDUCE_C
53 #undef BN_MP_REDUCE_IS_2K_C
54 #undef BN_MP_REDUCE_2K_SETUP_C
55 #undef BN_MP_REDUCE_2K_C
56 #undef BN_S_MP_EXPTMOD_C
57 #undef BN_MP_DIV_3_C
58 #undef BN_S_MP_MUL_HIGH_DIGS_C
59 #undef BN_FAST_S_MP_MUL_HIGH_DIGS_C
60 #undef BN_FAST_MP_INVMOD_C
61
62 /* To safely undefine these you have to make sure your RSA key won't exceed the Comba threshold
63 * which is roughly 255 digits [7140 bits for 32-bit machines, 15300 bits for 64-bit machines]
64 * which means roughly speaking you can handle upto 2536-bit RSA keys with these defined without
65 * trouble.
66 */
67 #undef BN_S_MP_MUL_DIGS_C
68 #undef BN_S_MP_SQR_C
69 #undef BN_MP_MONTGOMERY_REDUCE_C
70 #endif 43 #endif
71 44
45 /* Works for RSA only, mpi.o is 68KiB */
46 #if defined(SC_RSA_1) || defined (SC_RSA_1_WITH_TESTS)
47 # define BN_CUTOFFS_C
48 # define BN_MP_ADDMOD_C
49 # define BN_MP_CLEAR_MULTI_C
50 # define BN_MP_EXPTMOD_C
51 # define BN_MP_GCD_C
52 # define BN_MP_INIT_MULTI_C
53 # define BN_MP_INVMOD_C
54 # define BN_MP_LCM_C
55 # define BN_MP_MOD_C
56 # define BN_MP_MOD_D_C
57 # define BN_MP_MULMOD_C
58 # define BN_MP_PRIME_IS_PRIME_C
59 # define BN_MP_PRIME_RABIN_MILLER_TRIALS_C
60 # define BN_MP_PRIME_RAND_C
61 # define BN_MP_RADIX_SMAP_C
62 # define BN_MP_SET_INT_C
63 # define BN_MP_SHRINK_C
64 # define BN_MP_TO_UNSIGNED_BIN_C
65 # define BN_MP_UNSIGNED_BIN_SIZE_C
66 # define BN_PRIME_TAB_C
67 # define BN_S_MP_REVERSE_C
68
69 /* other modifiers */
70 # define BN_MP_DIV_SMALL /* Slower division, not critical */
71
72
73 /* here we are on the last pass so we turn things off. The functions classes are still there
74 * but we remove them specifically from the build. This also invokes tweaks in functions
75 * like removing support for even moduli, etc...
76 */
77 # ifdef LTM_LAST
78 # undef BN_MP_DR_IS_MODULUS_C
79 # undef BN_MP_DR_SETUP_C
80 # undef BN_MP_DR_REDUCE_C
81 # undef BN_MP_DIV_3_C
82 # undef BN_MP_REDUCE_2K_SETUP_C
83 # undef BN_MP_REDUCE_2K_C
84 # undef BN_MP_REDUCE_IS_2K_C
85 # undef BN_MP_REDUCE_SETUP_C
86 # undef BN_S_MP_BALANCE_MUL_C
87 # undef BN_S_MP_EXPTMOD_C
88 # undef BN_S_MP_INVMOD_FAST_C
89 # undef BN_S_MP_KARATSUBA_MUL_C
90 # undef BN_S_MP_KARATSUBA_SQR_C
91 # undef BN_S_MP_MUL_HIGH_DIGS_C
92 # undef BN_S_MP_MUL_HIGH_DIGS_FAST_C
93 # undef BN_S_MP_TOOM_MUL_C
94 # undef BN_S_MP_TOOM_SQR_C
95
96 # ifndef SC_RSA_1_WITH_TESTS
97 # undef BN_MP_REDUCE_C
98 # endif
99
100 /* To safely undefine these you have to make sure your RSA key won't exceed the Comba threshold
101 * which is roughly 255 digits [7140 bits for 32-bit machines, 15300 bits for 64-bit machines]
102 * which means roughly speaking you can handle upto 2536-bit RSA keys with these defined without
103 * trouble.
104 */
105 # undef BN_MP_MONTGOMERY_REDUCE_C
106 # undef BN_S_MP_MUL_DIGS_C
107 # undef BN_S_MP_SQR_C
108 # endif
109
72 #endif 110 #endif
73
74 /* ref: $Format:%D$ */
75 /* git commit: $Format:%H$ */
76 /* commit time: $Format:%ai$ */