X-Git-Url: https://git.librecmc.org/?a=blobdiff_plain;f=doc%2Fcrypto%2FBN_generate_prime.pod;h=7dccacbc1e553f6cf47cbfe4ce1eb9b8eea7404c;hb=ec14c80c7cd4949af0b2d85e4bd2952d22c1707f;hp=ff32b106765dd59f2b2dcdb0e8cb1c1b924c0a44;hpb=cdd43b5ba565cdf6c86acec3fef0298c31e65f32;p=oweals%2Fopenssl.git
diff --git a/doc/crypto/BN_generate_prime.pod b/doc/crypto/BN_generate_prime.pod
index ff32b10676..7dccacbc1e 100644
--- a/doc/crypto/BN_generate_prime.pod
+++ b/doc/crypto/BN_generate_prime.pod
@@ -2,7 +2,7 @@
=head1 NAME
-BN_generate_prime, BN_is_prime, BN_is_prime_fasttest - Generate primes and test for primality
+BN_generate_prime, BN_is_prime, BN_is_prime_fasttest - generate primes and test for primality
=head1 SYNOPSIS
@@ -11,11 +11,12 @@ BN_generate_prime, BN_is_prime, BN_is_prime_fasttest - Generate primes and test
BIGNUM *BN_generate_prime(BIGNUM *ret, int num, int safe, BIGNUM *add,
BIGNUM *rem, void (*callback)(int, int, void *), void *cb_arg);
- int BN_is_prime(BIGNUM *a, int checks, void (*callback)(int, int,
+ int BN_is_prime(const BIGNUM *a, int checks, void (*callback)(int, int,
void *), BN_CTX *ctx, void *cb_arg);
- int BN_is_prime_fasttest(BIGNUM *a, int checks, void (*callback)(int, int,
- void *), BN_CTX *ctx, BN_CTX *ctx2, void *cb_arg, int do_trial_division);
+ int BN_is_prime_fasttest(const BIGNUM *a, int checks,
+ void (*callback)(int, int, void *), BN_CTX *ctx, void *cb_arg,
+ int do_trial_division);
=head1 DESCRIPTION
@@ -56,36 +57,26 @@ that (p-1)/2 is also prime).
The PRNG must be seeded prior to calling BN_generate_prime().
The prime number generation has a negligible error probability.
-BN_is_prime() and BN_is_prime_fasttest test if the number B is
+BN_is_prime() and BN_is_prime_fasttest() test if the number B is
prime. The following tests are performed until one of them shows that
B is composite; if B passes all these tests, it is considered
prime.
-=over 4
-
-=item *
-
BN_is_prime_fasttest(), when called with B,
first attempts trial division by a number of small primes;
if no divisors are found by this test and B is not B,
B is called.
If B, this test is skipped.
-=item *
-
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
after the j-th iteration (j = 0, 1, ...). B is a
pre-allocated B (to save the overhead of allocating and
-freeing the structure in a loop), or B. For
-BN_is_prime_fasttest(), B is a second pre-allocated B or
-B (lacking this parameter, BN_is_prime() always has to allocated
-an additional B).
-
+freeing the structure in a loop), or B.
=head1 RETURN VALUES
@@ -99,7 +90,7 @@ The error codes can be obtained by L.
=head1 SEE ALSO
-L, L, L
+L, L, L
=head1 HISTORY