mirror of https://github.com/openssl/openssl.git
Fix typo in BN_generate_prime docs
CLA: trivial
Reviewed-by: Paul Dale <ppzgs1@gmail.com>
Reviewed-by: Kurt Roeckx <kurt@roeckx.be>
Reviewed-by: Tomas Mraz <tomas@openssl.org>
(Merged from https://github.com/openssl/openssl/pull/28395)
(cherry picked from commit b64ac3cb83
)
This commit is contained in:
parent
606f5085cb
commit
871e71ff6b
|
@ -130,7 +130,7 @@ or all the tests passed.
|
|||
If B<p> passes all these tests, it is considered a probable prime.
|
||||
|
||||
The test performed on B<p> are trial division by a number of small primes
|
||||
and rounds of the of the Miller-Rabin probabilistic primality test.
|
||||
and rounds of the Miller-Rabin probabilistic primality test.
|
||||
|
||||
The functions do at least 64 rounds of the Miller-Rabin test giving a maximum
|
||||
false positive rate of 2^-128.
|
||||
|
|
Loading…
Reference in New Issue