comparison tommath_superclass.h @ 142:d29b64170cf0 libtommath-orig

import of libtommath 0.32
author Matt Johnston <matt@ucc.asn.au>
date Sun, 19 Dec 2004 11:33:56 +0000
parents
children 97db060d0ef5
comparison
equal deleted inserted replaced
19:e1037a1e12e7 142:d29b64170cf0
1 /* super class file for PK algos */
2
3 /* default ... include all MPI */
4 #define LTM_ALL
5
6 /* RSA only (does not support DH/DSA/ECC) */
7 // #define SC_RSA_1
8
9 /* For reference.... On an Athlon64 optimizing for speed...
10
11 LTM's mpi.o with all functions [striped] is 142KiB in size.
12
13 */
14
15 /* Works for RSA only, mpi.o is 68KiB */
16 #ifdef SC_RSA_1
17 #define BN_MP_SHRINK_C
18 #define BN_MP_LCM_C
19 #define BN_MP_PRIME_RANDOM_EX_C
20 #define BN_MP_INVMOD_C
21 #define BN_MP_GCD_C
22 #define BN_MP_MOD_C
23 #define BN_MP_MULMOD_C
24 #define BN_MP_ADDMOD_C
25 #define BN_MP_EXPTMOD_C
26 #define BN_MP_SET_INT_C
27 #define BN_MP_INIT_MULTI_C
28 #define BN_MP_CLEAR_MULTI_C
29 #define BN_MP_UNSIGNED_BIN_SIZE_C
30 #define BN_MP_TO_UNSIGNED_BIN_C
31 #define BN_MP_MOD_D_C
32 #define BN_MP_PRIME_RABIN_MILLER_TRIALS_C
33 #define BN_REVERSE_C
34 #define BN_PRIME_TAB_C
35
36 /* other modifiers */
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
71
72 #endif