1 /* LibTomMath, multiple-precision integer library -- Tom St Denis 2 * 3 * LibTomMath is a library that provides multiple-precision 4 * integer arithmetic as well as number theoretic functionality. 5 * 6 * The library was designed directly after the MPI library by 7 * Michael Fromberger but has been written from scratch with 8 * additional optimizations in place. 9 * 10 * SPDX-License-Identifier: Unlicense 11 */ 12 13 /* super class file for PK algos */ 14 15 /* default ... include all MPI */ 16 #define LTM_ALL 17 18 /* RSA only (does not support DH/DSA/ECC) */ 19 /* #define SC_RSA_1 */ 20 21 /* For reference.... On an Athlon64 optimizing for speed... 22 23 LTM's mpi.o with all functions [striped] is 142KiB in size. 24 25 */ 26 27 /* Works for RSA only, mpi.o is 68KiB */ 28 #ifdef SC_RSA_1 29 # define BN_MP_SHRINK_C 30 # define BN_MP_LCM_C 31 # define BN_MP_PRIME_RANDOM_EX_C 32 # define BN_MP_INVMOD_C 33 # define BN_MP_GCD_C 34 # define BN_MP_MOD_C 35 # define BN_MP_MULMOD_C 36 # define BN_MP_ADDMOD_C 37 # define BN_MP_EXPTMOD_C 38 # define BN_MP_SET_INT_C 39 # define BN_MP_INIT_MULTI_C 40 # define BN_MP_CLEAR_MULTI_C 41 # define BN_MP_UNSIGNED_BIN_SIZE_C 42 # define BN_MP_TO_UNSIGNED_BIN_C 43 # define BN_MP_MOD_D_C 44 # define BN_MP_PRIME_RABIN_MILLER_TRIALS_C 45 # define BN_REVERSE_C 46 # define BN_PRIME_TAB_C 47 48 /* other modifiers */ 49 # define BN_MP_DIV_SMALL /* Slower division, not critical */ 50 51 /* here we are on the last pass so we turn things off. The functions classes are still there 52 * but we remove them specifically from the build. This also invokes tweaks in functions 53 * like removing support for even moduli, etc... 54 */ 55 # ifdef LTM_LAST 56 # undef BN_MP_TOOM_MUL_C 57 # undef BN_MP_TOOM_SQR_C 58 # undef BN_MP_KARATSUBA_MUL_C 59 # undef BN_MP_KARATSUBA_SQR_C 60 # undef BN_MP_REDUCE_C 61 # undef BN_MP_REDUCE_SETUP_C 62 # undef BN_MP_DR_IS_MODULUS_C 63 # undef BN_MP_DR_SETUP_C 64 # undef BN_MP_DR_REDUCE_C 65 # undef BN_MP_REDUCE_IS_2K_C 66 # undef BN_MP_REDUCE_2K_SETUP_C 67 # undef BN_MP_REDUCE_2K_C 68 # undef BN_S_MP_EXPTMOD_C 69 # undef BN_MP_DIV_3_C 70 # undef BN_S_MP_MUL_HIGH_DIGS_C 71 # undef BN_FAST_S_MP_MUL_HIGH_DIGS_C 72 # undef BN_FAST_MP_INVMOD_C 73 74 /* To safely undefine these you have to make sure your RSA key won't exceed the Comba threshold 75 * which is roughly 255 digits [7140 bits for 32-bit machines, 15300 bits for 64-bit machines] 76 * which means roughly speaking you can handle upto 2536-bit RSA keys with these defined without 77 * trouble. 78 */ 79 # undef BN_S_MP_MUL_DIGS_C 80 # undef BN_S_MP_SQR_C 81 # undef BN_MP_MONTGOMERY_REDUCE_C 82 # endif 83 84 #endif 85 86 /* ref: $Format:%D$ */ 87 /* git commit: $Format:%H$ */ 88 /* commit time: $Format:%ai$ */ 89