Update all links so they will be rendered better.

[oweals/openssl.git] / doc / crypto / BN_generate_prime.pod

diff --git a/doc/crypto/BN_generate_prime.pod b/doc/crypto/BN_generate_prime.pod
index 6744d5d81530248f1daee1ac12f27c021d098a16..3cd239e89395158ef8d5255f55f3e3d9f5b80883 100644 (file)
--- 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.
 
@@ -72,11 +72,11 @@ BN_is_prime() returns 0 if the number is composite, 1 if it is
 prime with an error probability of less than 0.25^B<checks>, and
 -1 on error.
 
-The error codes can be obtained by ERR_get_error(3).
+The error codes can be obtained by L<ERR_get_error(3)|ERR_get_error(3)>.
 
 =head1 SEE ALSO
 
-bn(3), err(3), rand(3)
+L<bn(3)|bn(3)>, L<err(3)|err(3)>, L<rand(3)|rand(3)>
 
 =head1 HISTORY