- 03 2月, 2000 5 次提交
-
-
由 Bodo Möller 提交于
-
由 Bodo Möller 提交于
-
由 Bodo Möller 提交于
-
由 Bodo Möller 提交于
-
由 Andy Polyakov 提交于
crypto/bn/bn_lcl.h for further details. It should be noted that for the moment of this writing the code was tested only on Alpha. If compiled with DEC C the C implementation exhibits 12% performance improvement over the crypto/bn/asm/alpha.s (on EV56 box running AlphaLinux). GNU C is (unfortunately) 8% behind the assembler implementation. But it's OpenVMS Alpha users who *may* benefit most as 'apps/openssl speed rsa' exhibits 6 (six) times performance improvement over the original VMS bignum implementation. Where "*may*" means "as soon as code is enabled though #define SIXTY_FOUR_BIT and crypto/bn/asm/vms.mar is skipped."
-
- 02 2月, 2000 2 次提交
-
-
由 Ulf Möller 提交于
primes (negligible for larger ones).
-
由 Ulf Möller 提交于
-
- 01 2月, 2000 4 次提交
-
-
由 Bodo Möller 提交于
-
由 Bodo Möller 提交于
-
由 Ulf Möller 提交于
-
由 Ulf Möller 提交于
Submitted by: Martin Kraemer <martin.kraemer@mch.sni.de>
-
- 31 1月, 2000 1 次提交
-
-
由 Ulf Möller 提交于
-
- 30 1月, 2000 2 次提交
-
-
由 Bodo Möller 提交于
-
由 Bodo Möller 提交于
(including another problem in the s3_srvr.c state machine).
-
- 28 1月, 2000 4 次提交
-
-
由 Richard Levitte 提交于
-
由 Bodo Möller 提交于
-
由 Ulf Möller 提交于
-
由 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 6 次提交
-
-
由 Bodo Möller 提交于
-
由 Bodo Möller 提交于
-
由 Bodo Möller 提交于
word-based algorithm we are using?)
-
由 Bodo Möller 提交于
-
由 Bodo Möller 提交于
-
由 Ulf Möller 提交于
Clean up bn_mont.c.
-
- 24 1月, 2000 2 次提交
-
-
由 Dr. Stephen Henson 提交于
Tidy up CRYPTO_EX_DATA structures.
-
由 Ulf Möller 提交于
-
- 23 1月, 2000 1 次提交
-
-
由 Ulf Möller 提交于
-
- 21 1月, 2000 2 次提交
-
-
由 Ulf Möller 提交于
-
由 Bodo Möller 提交于
-
- 15 1月, 2000 1 次提交
-
-
由 Bodo Möller 提交于
because otherwise BN_rand will fail unless DEVRANDOM works, which causes the programs to dump core because they don't check the return value of BN_rand (and if they did, we still couldn't test anything). - add comment to some files that appear not to be used at all.
-
- 14 1月, 2000 1 次提交
-
-
由 Ulf Möller 提交于
returns int (1 = ok, 0 = not seeded). New function RAND_add() is the same as RAND_seed() but takes an estimate of the entropy as an additional argument.
-
- 12 1月, 2000 2 次提交
-
-
由 Bodo Möller 提交于
Primes p where (p-1)/2 is prime too are called "safe", not "strong".
-
由 Bodo Möller 提交于
(created by bn_prime.pl, which now prints the copyright/license note as found in bn_prime.h)
-
- 26 12月, 1999 1 次提交
-
-
由 Andy Polyakov 提交于
-
- 14 12月, 1999 1 次提交
-
-
由 Ulf Möller 提交于
(bug reports keep coming in because that was still missing in 0.9.4)
-
- 09 12月, 1999 1 次提交
-
-
由 Ulf Möller 提交于
-
- 03 11月, 1999 1 次提交
-
-
由 Mark J. Cox 提交于
problem was that one of the replacement routines had not been working since SSLeay releases. For now the offending routine has been replaced with non-optimised assembler. Even so, this now gives around 95% performance improvement for 1024 bit RSA signs.
-
- 26 10月, 1999 1 次提交
-
-
由 Bodo Möller 提交于
Submitted by: Lennart Bång, Bodo Möller
-
- 30 9月, 1999 1 次提交
-
-
由 Ulf Möller 提交于
-
- 25 8月, 1999 1 次提交
-
-
由 Andy Polyakov 提交于
-