summaryrefslogtreecommitdiffstats
path: root/doc/crypto/BN_generate_prime.pod
diff options
context:
space:
mode:
authorBodo Möller <bodo@openssl.org>2000-01-22 23:11:13 +0000
committerBodo Möller <bodo@openssl.org>2000-01-22 23:11:13 +0000
commitc88a900fa1348a47d69a13da7bb1205178a3472d (patch)
treee7a200dcecb30705d754235f4b21e2535599b0ff /doc/crypto/BN_generate_prime.pod
parent2a99e8b9df536df9f87fb3a6997ac42383787cf1 (diff)
update PRNG documentation/comments
Diffstat (limited to 'doc/crypto/BN_generate_prime.pod')
-rw-r--r--doc/crypto/BN_generate_prime.pod2
1 files changed, 1 insertions, 1 deletions
diff --git a/doc/crypto/BN_generate_prime.pod b/doc/crypto/BN_generate_prime.pod
index 6744d5d815..768149efe8 100644
--- a/doc/crypto/BN_generate_prime.pod
+++ b/doc/crypto/BN_generate_prime.pod
@@ -55,7 +55,7 @@ The prime number generation has a negligible error probability.
BN_is_prime() tests if the number B<a> is prime. This is done by
performing a Miller-Rabin probabilistic primality test with B<checks>
-iterations. If B<checks == BN_prime_check>, it uses the minimal number
+iterations. If B<checks == BN_prime_check>, it uses a number
of iterations that yields a false positive rate of at most 2^-80 for
random input.