X-Git-Url: https://git.librecmc.org/?a=blobdiff_plain;f=doc%2Fcrypto%2FBN_generate_prime.pod;h=7dccacbc1e553f6cf47cbfe4ce1eb9b8eea7404c;hb=ec14c80c7cd4949af0b2d85e4bd2952d22c1707f;hp=638f6514ee8a0a139b16b1bafb4b1a8397d9691f;hpb=4d524e10b4853436a1bfbc83822c5d0e87d64fbd;p=oweals%2Fopenssl.git diff --git a/doc/crypto/BN_generate_prime.pod b/doc/crypto/BN_generate_prime.pod index 638f6514ee..7dccacbc1e 100644 --- a/doc/crypto/BN_generate_prime.pod +++ b/doc/crypto/BN_generate_prime.pod @@ -70,7 +70,7 @@ If B, this test is skipped. Both BN_is_prime() and BN_is_prime_fasttest() perform a Miller-Rabin probabilistic primality test with B iterations. If -B, a number of iterations is used that +B, a number of iterations is used that yields a false positive rate of at most 2^-80 for random input. If B is not B, B is called @@ -90,7 +90,7 @@ The error codes can be obtained by L. =head1 SEE ALSO -L, L, L +L, L, L =head1 HISTORY