aboutsummaryrefslogtreecommitdiff
path: root/doc
diff options
context:
space:
mode:
authorKurt Roeckx <kurt@roeckx.be>2018-07-26 11:10:24 +0200
committerKurt Roeckx <kurt@roeckx.be>2018-07-26 11:25:04 +0200
commitb9e54e98066c1ff8adab5d68b6c114b14d2f74e5 (patch)
tree2768193e0d857362f65ca1b28b934e13ce1eafec /doc
parent9e4c97774861949f6f987772c0b579fe8a9c7d5a (diff)
downloadopenssl-b9e54e98066c1ff8adab5d68b6c114b14d2f74e5.zip
openssl-b9e54e98066c1ff8adab5d68b6c114b14d2f74e5.tar.gz
openssl-b9e54e98066c1ff8adab5d68b6c114b14d2f74e5.tar.bz2
Fix inconsisten use of bit vs bits
Reviewed-by: Tim Hudson <tjh@openssl.org> GH: #6794
Diffstat (limited to 'doc')
-rw-r--r--doc/man3/BN_generate_prime.pod4
1 files changed, 2 insertions, 2 deletions
diff --git a/doc/man3/BN_generate_prime.pod b/doc/man3/BN_generate_prime.pod
index 4b085e7..7cfa96e 100644
--- a/doc/man3/BN_generate_prime.pod
+++ b/doc/man3/BN_generate_prime.pod
@@ -103,8 +103,8 @@ probabilistic primality test with B<nchecks> iterations. If
B<nchecks == BN_prime_checks>, a number of iterations is used that
yields a false positive rate of at most 2^-64 for random input.
The error rate depends on the size of the prime and goes down for bigger primes.
-The rate is 2^-80 starting at 308 bits, 2^-112 at 852 bit, 2^-128 at 1080 bits,
-2^-192 at 3747 bit and 2^-256 at 6394 bit.
+The rate is 2^-80 starting at 308 bits, 2^-112 at 852 bits, 2^-128 at 1080 bits,
+2^-192 at 3747 bits and 2^-256 at 6394 bits.
When the source of the prime is not random or not trusted, the number
of checks needs to be much higher to reach the same level of assurance: