summaryrefslogtreecommitdiff
path: root/doc
diff options
context:
space:
mode:
authorBodo Möller <bodo@openssl.org>2003-01-13 13:18:22 +0000
committerBodo Möller <bodo@openssl.org>2003-01-13 13:18:22 +0000
commitbda2fa364d1002d2b5d4d500eb573cd5d9c02207 (patch)
tree1b941a8369d13b1e8d4f8eba6c3ce05fde339fd5 /doc
parentcaa7b2ad4f0f3ef895122511725c7e2101d87dfb (diff)
downloadopenssl-new-bda2fa364d1002d2b5d4d500eb573cd5d9c02207.tar.gz
Typo.
NB: This and other manual pages should be updated for the new BN_GENCB interface.
Diffstat (limited to 'doc')
-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 6ea23791d1..7dccacbc1e 100644
--- a/doc/crypto/BN_generate_prime.pod
+++ b/doc/crypto/BN_generate_prime.pod
@@ -70,7 +70,7 @@ If B<do_trial_division == 0>, this test is skipped.
Both BN_is_prime() and BN_is_prime_fasttest() perform a Miller-Rabin
probabilistic primality test with B<checks> iterations. If
-B<checks == BN_prime_check>, a number of iterations is used that
+B<checks == BN_prime_checks>, a number of iterations is used that
yields a false positive rate of at most 2^-80 for random input.
If B<callback> is not B<NULL>, B<callback(1, j, cb_arg)> is called