Ben Laurie
|
46838817c7
Constify and reduce coprime random bits to allow for multiplier.
|
10 years ago |
Felix Laurie von Massenbach
|
8927c2786d
Add a test to check we're really generating probable primes.
|
10 years ago |
Felix Laurie von Massenbach
|
9a3a99748b
Remove unused BIGNUMs.
|
10 years ago |
Felix Laurie von Massenbach
|
c74e148776
Refactor the first prime index.
|
10 years ago |
Felix Laurie von Massenbach
|
982c42cb20
Try skipping over the adding and just picking a new random number.
|
10 years ago |
Felix Laurie von Massenbach
|
c09ec5d2a0
Generate safe primes not divisible by 3, 5 or 7.
|
10 years ago |
Felix Laurie von Massenbach
|
b0513819e0
Add a method to generate a prime that is guaranteed not to be divisible by 3 or 5.
|
10 years ago |
Felix Laurie von Massenbach
|
e46a059ebf
Remove static from probable_prime_dh.
|
10 years ago |
Felix Laurie von Massenbach
|
e55fca760b
Remove indentation from the goto targets.
|
10 years ago |
Adam Langley
|
96a4c31be3
Ensure that, when generating small primes, the result is actually of the
|
11 years ago |
Andy Polyakov
|
75a8e30f4f
Minimize stack utilization in probable_prime.
|
17 years ago |
Bodo Möller
|
a53cdc5b08
Ensure that the addition mods[i]+delta cannot overflow in probable_prime().
|
18 years ago |
Nils Larsch
|
2c5fadbce3
2 is a prime
|
19 years ago |
Geoff Thorpe
|
c86f2054f3
Adjust various bignum functions to use BN_CTX for variables instead of
|
20 years ago |
Geoff Thorpe
|
d870740cd7
Put the first stage of my bignum debugging adventures into CVS. This code
|
21 years ago |
Ben Laurie
|
2619676256
Old-style callbacks can be NULL!
|
22 years ago |
Richard Levitte
|
f8ea5cb579
Make sure everything that may be freed is allocated or initiated.
|
22 years ago |
Geoff Thorpe
|
e189872486
Nils Larsch submitted;
|
22 years ago |
Geoff Thorpe
|
e9224c7177
This is a first-cut at improving the callback mechanisms used in
|
22 years ago |
Bodo Möller
|
435037d4e4
OpenSSL copyright notices ...
|
23 years ago |
Geoff Thorpe
|
91b3f0e691
Correct a typo.
|
23 years ago |
Bodo Möller
|
983495c4b2
Use uniformly chosen witnesses for Miller-Rabin test
|
23 years ago |
Richard Levitte
|
020fc820dc
Constify the BIGNUM routines a bit more. The only trouble were the
|
24 years ago |
Ulf Möller
|
9b141126d4
New functions BN_CTX_start(), BN_CTX_get(), BN_CTX_end() to access
|
25 years ago |
Ulf Möller
|
657e60fa00
ispell (and minor modifications)
|
25 years ago |
Bodo Möller
|
7999c65c9b
Some 'const's for BNs.
|
25 years ago |
Bodo Möller
|
bfe30e4d1b
Include OpenSSL license.
|
25 years ago |
Bodo Möller
|
aff0825c61
Tolerate negative numbers in BN_is_prime.
|
25 years ago |
Bodo Möller
|
e74231ed9e
rndsort{Miller, Rabin} primality test.
|
25 years ago |
Ulf Möller
|
1399f17a07
Bug fix: BN_is_prime() would fail with a high probability for small
|
25 years ago |