Domovská stránka Prehľadávať Pomoc
Prihlásiť sa
8516
/
Test
1
0
Fork 0
Súbory Issues 0 Pull requesty 0 Wiki
Branch: master
Branche Tagy
Test
/
EVSE
/
GPL
/
dropbear-2017.75
/
libtommath
/
tommath_superclass.h

tommath_superclass.h 2.3 KB
Permanentný odkaz História Raw

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576 
  1. /* super class file for PK algos */
    2. 

  2. 

  3. /* default ... include all MPI */
    4. 

  4. #define LTM_ALL
    5. 

  5. 

  6. /* RSA only (does not support DH/DSA/ECC) */
    7. 

  7. /* #define SC_RSA_1 */
    8. 

  8. 

  9. /* For reference.... On an Athlon64 optimizing for speed...
    10. 

  10. 

  11.    LTM's mpi.o with all functions [striped] is 142KiB in size.
    12. 

  12. 

  13. */
    14. 

  14. 

  15. /* Works for RSA only, mpi.o is 68KiB */
    16. 

  16. #ifdef SC_RSA_1
    17. 

  17.    #define BN_MP_SHRINK_C
    18. 

  18.    #define BN_MP_LCM_C
    19. 

  19.    #define BN_MP_PRIME_RANDOM_EX_C
    20. 

  20.    #define BN_MP_INVMOD_C
    21. 

  21.    #define BN_MP_GCD_C
    22. 

  22.    #define BN_MP_MOD_C
    23. 

  23.    #define BN_MP_MULMOD_C
    24. 

  24.    #define BN_MP_ADDMOD_C
    25. 

  25.    #define BN_MP_EXPTMOD_C
    26. 

  26.    #define BN_MP_SET_INT_C
    27. 

  27.    #define BN_MP_INIT_MULTI_C
    28. 

  28.    #define BN_MP_CLEAR_MULTI_C
    29. 

  29.    #define BN_MP_UNSIGNED_BIN_SIZE_C
    30. 

  30.    #define BN_MP_TO_UNSIGNED_BIN_C
    31. 

  31.    #define BN_MP_MOD_D_C
    32. 

  32.    #define BN_MP_PRIME_RABIN_MILLER_TRIALS_C
    33. 

  33.    #define BN_REVERSE_C
    34. 

  34.    #define BN_PRIME_TAB_C
    35. 

  35. 

  36.    /* other modifiers */
    37. 

  37.    #define BN_MP_DIV_SMALL                    /* Slower division, not critical */
    38. 

  38. 

  39.    /* here we are on the last pass so we turn things off.  The functions classes are still there
    40. 

  40.     * but we remove them specifically from the build.  This also invokes tweaks in functions
    41. 

  41.     * like removing support for even moduli, etc...
    42. 

  42.     */
    43. 

  43. #ifdef LTM_LAST
    44. 

  44.    #undef  BN_MP_TOOM_MUL_C
    45. 

  45.    #undef  BN_MP_TOOM_SQR_C
    46. 

  46.    #undef  BN_MP_KARATSUBA_MUL_C
    47. 

  47.    #undef  BN_MP_KARATSUBA_SQR_C
    48. 

  48.    #undef  BN_MP_REDUCE_C
    49. 

  49.    #undef  BN_MP_REDUCE_SETUP_C
    50. 

  50.    #undef  BN_MP_DR_IS_MODULUS_C
    51. 

  51.    #undef  BN_MP_DR_SETUP_C
    52. 

  52.    #undef  BN_MP_DR_REDUCE_C
    53. 

  53.    #undef  BN_MP_REDUCE_IS_2K_C
    54. 

  54.    #undef  BN_MP_REDUCE_2K_SETUP_C
    55. 

  55.    #undef  BN_MP_REDUCE_2K_C
    56. 

  56.    #undef  BN_S_MP_EXPTMOD_C
    57. 

  57.    #undef  BN_MP_DIV_3_C
    58. 

  58.    #undef  BN_S_MP_MUL_HIGH_DIGS_C
    59. 

  59.    #undef  BN_FAST_S_MP_MUL_HIGH_DIGS_C
    60. 

  60.    #undef  BN_FAST_MP_INVMOD_C
    61. 

  61. 

  62.    /* To safely undefine these you have to make sure your RSA key won't exceed the Comba threshold
    63. 

  63.     * which is roughly 255 digits [7140 bits for 32-bit machines, 15300 bits for 64-bit machines] 
    64. 

  64.     * which means roughly speaking you can handle upto 2536-bit RSA keys with these defined without
    65. 

  65.     * trouble.  
    66. 

  66.     */
    67. 

  67.    #undef  BN_S_MP_MUL_DIGS_C
    68. 

  68.    #undef  BN_S_MP_SQR_C
    69. 

  69.    #undef  BN_MP_MONTGOMERY_REDUCE_C
    70. 

  70. #endif
    71. 

  71. 

  72. #endif
    73. 

  73. 

  74. /* $Source: /cvs/libtom/libtommath/tommath_superclass.h,v $ */
    75. 

  75. /* $Revision: 1.3 $ */
    76. 

  76. /* $Date: 2005/05/14 13:29:17 $ */
    77.