- 20 2月, 2001 2 次提交
-
-
由 Richard Levitte 提交于
-
由 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.
-
- 10 2月, 2001 1 次提交
-
-
由 Bodo Möller 提交于
-
- 08 2月, 2001 2 次提交
-
-
由 Bodo Möller 提交于
Bleichenbacher's DSA attack. With this implementation, the expected number of iterations never exceeds 2. New semantics for BN_rand_range(): BN_rand_range(r, min, range) now generates r such that min <= r < min+range. (Previously, BN_rand_range(r, min, max) generated r such that min <= r < max. It is more convenient to have the range; also the previous prototype was misleading because max was larger than the actual maximum.)
-
由 Ulf Möller 提交于
-
- 04 12月, 2000 1 次提交
-
-
由 Bodo Möller 提交于
-
- 03 12月, 2000 1 次提交
-
-
由 Bodo Möller 提交于
might overflow.
-
- 02 12月, 2000 1 次提交
-
-
由 Ulf Möller 提交于
The bn_cmp_part_words bug was only caught in the BN_mod_mul() test, not in the BN_mul() test, so apparently the choice of parameters in some cases is bad.
-
- 30 11月, 2000 1 次提交
-
-
由 Bodo Möller 提交于
-
- 29 11月, 2000 1 次提交
-
-
由 Bodo Möller 提交于
This caused a segmentation fault in calls to malloc, so I cleaned up bn_lib.c a little so that it is easier to see what is going on. The bug turned out to be an off-by-one error in BN_bin2bn.
-
- 28 11月, 2000 1 次提交
-
-
由 Bodo Möller 提交于
Fix BN_gcd. Analyze BN_mod_inverse. Add BN_kronecker. "make update".
-
- 27 11月, 2000 2 次提交
-
-
由 Bodo Möller 提交于
-
由 Bodo Möller 提交于
"make update"
-
- 17 11月, 2000 2 次提交
-
-
由 Richard Levitte 提交于
declarations of bn_add_part_words() and bn_sub_part_words() since they do not exist.
-
由 Richard Levitte 提交于
-
- 08 11月, 2000 1 次提交
-
-
由 Bodo Möller 提交于
-
- 07 11月, 2000 1 次提交
-
-
由 Richard Levitte 提交于
two functions that did expansion on in parameters (BN_mul() and BN_sqr()). The problem was solved by making bn_dup_expand() which is a mix of bn_expand2() and BN_dup().
-
- 04 8月, 2000 1 次提交
-
-
由 Dr. Stephen Henson 提交于
Fix warnings with BIO_dump_indent().
-
- 09 6月, 2000 1 次提交
-
-
由 Bodo Möller 提交于
marginally faster BN_mod_exp for 1024 bit exponents.
-
- 08 6月, 2000 1 次提交
-
-
由 Bodo Möller 提交于
-
- 02 6月, 2000 1 次提交
-
-
由 Ulf Möller 提交于
-
- 01 3月, 2000 1 次提交
-
-
由 Ulf Möller 提交于
-
- 27 2月, 2000 1 次提交
-
-
由 Ulf Möller 提交于
-
- 06 2月, 2000 2 次提交
-
-
由 Bodo Möller 提交于
and initialize too_many because memset(..., 0, ...) is not used here.
-
由 Ulf Möller 提交于
algorithm is used.
-
- 05 2月, 2000 1 次提交
-
-
由 Ulf Möller 提交于
temporary BIGNUMs. BN_CTX still uses a fixed number of BIGNUMs, but the BN_CTX implementation could now easily be changed.
-
- 04 2月, 2000 1 次提交
-
-
由 Ulf Möller 提交于
-
- 03 2月, 2000 3 次提交
-
-
由 Bodo Möller 提交于
-
由 Bodo Möller 提交于
-
由 Bodo Möller 提交于
-
- 30 1月, 2000 1 次提交
-
-
由 Bodo Möller 提交于
(including another problem in the s3_srvr.c state machine).
-
- 28 1月, 2000 2 次提交
-
-
由 Richard Levitte 提交于
-
由 Ulf Möller 提交于
New function BN_pseudo_rand(). Use BN_prime_checks_size(BN_num_bits(w)) rounds of Miller-Rabin when generating DSA primes (why not use BN_is_prime()?)
-
- 27 1月, 2000 2 次提交
-
-
由 Bodo Möller 提交于
-
由 Ulf Möller 提交于
Clean up bn_mont.c.
-
- 24 1月, 2000 1 次提交
-
-
由 Ulf Möller 提交于
-
- 23 1月, 2000 1 次提交
-
-
由 Ulf Möller 提交于
-
- 12 1月, 2000 1 次提交
-
-
由 Bodo Möller 提交于
Primes p where (p-1)/2 is prime too are called "safe", not "strong".
-
- 29 6月, 1999 1 次提交
-
-
由 Ulf Möller 提交于
-
- 28 6月, 1999 1 次提交
-
-
由 Bodo Möller 提交于
not work, at least the package mentioned in INSTALL.W32 does not know about it).
-