[openssl-commits] [openssl] OpenSSL_1_1_0-stable update

[Kurt Roeckx]

The branch OpenSSL_1_1_0-stable has been updated
       via  616153f2f9c07f51212fb5e85170e89a4ebaadbb (commit)
      from  707efcd64129c8010e192bd209bace0bc6d18ac9 (commit)


- Log -----------------------------------------------------------------
commit 616153f2f9c07f51212fb5e85170e89a4ebaadbb
Author: Kurt Roeckx <kurt at roeckx.be>
Date:   Thu Jul 26 11:10:24 2018 +0200

    Fix inconsistent use of bit vs bits
    
    Reviewed-by: Tim Hudson <tjh at openssl.org>
    GH: #6794
    (cherry picked from commit b9e54e98066c1ff8adab5d68b6c114b14d2f74e5)

-----------------------------------------------------------------------

Summary of changes:
 doc/crypto/BN_generate_prime.pod | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/doc/crypto/BN_generate_prime.pod b/doc/crypto/BN_generate_prime.pod
index 4adc3c8..849df07 100644
--- a/doc/crypto/BN_generate_prime.pod
+++ b/doc/crypto/BN_generate_prime.pod
@@ -102,8 +102,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: