1. 27 4月, 2005 2 次提交
    • D
      Port BN_MONT_CTX_set_locked() from stable branch. · 6ec8e63a
      Dr. Stephen Henson 提交于
      The function rsa_eay_mont_helper() has been removed because it is no longer
      needed after this change.
      6ec8e63a
    • N
      some updates for the blinding code; summary: · 800e400d
      Nils Larsch 提交于
      - possibility of re-creation of the blinding parameters after a
        fixed number of uses (suggested by Bodo)
      - calculatition of the rsa::e in case it's absent and p and q
        are present (see bug report #785)
      - improve the performance when if one rsa structure is shared by
        more than a thread (see bug report #555)
      - fix the problem described in bug report #827
      - hide the definition ot the BN_BLINDING structure in bn_blind.c
      800e400d
  2. 23 4月, 2005 1 次提交
  3. 25 3月, 2004 1 次提交
    • G
      By adding a BN_CTX parameter to the 'rsa_mod_exp' callback, private key · 46ef873f
      Geoff Thorpe 提交于
      operations no longer require two distinct BN_CTX structures. This may put
      more "strain" on the current BN_CTX implementation (which has a fixed limit
      to the number of variables it will hold), but so far this limit is not
      triggered by any of the tests pass and I will be changing BN_CTX in the
      near future to avoid this problem anyway.
      
      This also changes the default RSA implementation code to use the BN_CTX in
      favour of initialising some of its variables locally in each function.
      46ef873f
  4. 16 3月, 2004 1 次提交
  5. 15 4月, 2003 1 次提交
  6. 08 4月, 2003 1 次提交
  7. 02 4月, 2003 1 次提交
  8. 21 3月, 2003 1 次提交
  9. 15 2月, 2003 2 次提交
    • G
      We cache a montgomery form for 'n' if the PUBLIC flag is set, not PRIVATE. · b12753df
      Geoff Thorpe 提交于
      Also, I've added handling for other mod_exp calls that were not using any
      cached montgomery forms. These cases matter only for special RSA keys (eg.
      ones that are missing information) so are unlikely to be used in normal
      circumstances.
      b12753df
    • G
      David Brumley <dbrumley@stanford.edu> noted and corrected a case in the · 79221bc2
      Geoff Thorpe 提交于
      verification step of CRT private key operations in the RSA code -
      previously no montgomery form was checked or used for 'n', and so it would
      be generated on the fly each time. As a result, private key operations are
      now a percent or two faster.
      
      Rather than adding this as another repetition of the nearly-identical
      montgomery "check for first-use" initialisation code blocks, I've taken
      this chance to create a helper function and macro-wrapper to replace them.
      
      PR: 475
      79221bc2
  10. 31 1月, 2003 1 次提交
  11. 07 1月, 2003 1 次提交
  12. 28 11月, 2002 1 次提交
  13. 04 11月, 2002 1 次提交
  14. 31 5月, 2002 1 次提交
  15. 26 9月, 2001 1 次提交
    • G
      This commits changes to various parts of libcrypto required by the recent · cb78486d
      Geoff Thorpe 提交于
      ENGINE surgery. DH, DSA, RAND, and RSA now use *both* "method" and ENGINE
      pointers to manage their hooking with ENGINE. Previously their use of
      "method" pointers was replaced by use of ENGINE references. See
      crypto/engine/README for details.
      
      Also, remove the ENGINE iterations from evp_test - even when the
      cipher/digest code is committed in, this functionality would require a
      different set of API calls.
      cb78486d
  16. 20 9月, 2001 1 次提交
  17. 26 7月, 2001 1 次提交
  18. 20 7月, 2001 1 次提交
    • G
      Currently, RSA code, when using no padding scheme, simply checks that input · 81d1998e
      Geoff Thorpe 提交于
      does not contain more bytes than the RSA modulus 'n' - it does not check
      that the input is strictly *less* than 'n'. Whether this should be the
      case or not is open to debate - however, due to security problems with
      returning miscalculated CRT results, the 'rsa_mod_exp' implementation in
      rsa_eay.c now performs a public-key exponentiation to verify the CRT result
      and in the event of an error will instead recalculate and return a non-CRT
      (more expensive) mod_exp calculation. As the mod_exp of 'I' is equivalent
      to the mod_exp of 'I mod n', and the verify result is automatically between
      0 and n-1 inclusive, the verify only matches the input if 'I' was less than
      'n', otherwise even a correct CRT calculation is only congruent to 'I' (ie.
      they differ by a multiple of 'n'). Rather than rejecting correct
      calculations and doing redundant and slower ones instead, this changes the
      equality check in the verification code to a congruence check.
      81d1998e
  19. 28 3月, 2001 2 次提交
  20. 20 2月, 2001 1 次提交
    • R
      Make all configuration macros available for application by making · cf1b7d96
      Richard Levitte 提交于
      sure they are available in opensslconf.h, by giving them names starting
      with "OPENSSL_" to avoid conflicts with other packages and by making
      sure e_os2.h will cover all platform-specific cases together with
      opensslconf.h.
      
      I've checked fairly well that nothing breaks with this (apart from
      external software that will adapt if they have used something like
      NO_KRB5), but I can't guarantee it completely, so a review of this
      change would be a good thing.
      cf1b7d96
  21. 19 12月, 2000 3 次提交
  22. 18 12月, 2000 1 次提交
  23. 07 11月, 2000 2 次提交
  24. 27 10月, 2000 1 次提交
  25. 02 6月, 2000 1 次提交
    • R
      There have been a number of complaints from a number of sources that names · 26a3a48d
      Richard Levitte 提交于
      like Malloc, Realloc and especially Free conflict with already existing names
      on some operating systems or other packages.  That is reason enough to change
      the names of the OpenSSL memory allocation macros to something that has a
      better chance of being unique, like prepending them with OPENSSL_.
      
      This change includes all the name changes needed throughout all C files.
      26a3a48d
  26. 04 2月, 2000 1 次提交
  27. 09 9月, 1999 1 次提交
  28. 28 7月, 1999 1 次提交
  29. 27 4月, 1999 2 次提交
  30. 24 4月, 1999 1 次提交
  31. 20 4月, 1999 1 次提交
  32. 11 3月, 1999 1 次提交
  33. 18 2月, 1999 1 次提交