rndsort{Miller, Rabin} primality test.

1 files changed, 2 insertions, 6 deletions

diff --git a/doc/crypto/BN_generate_prime.pod b/doc/crypto/BN_generate_prime.pod
index c2cc151cf6..ab84d3fcfc 100644
--- a/doc/crypto/BN_generate_prime.pod
+++ b/doc/crypto/BN_generate_prime.pod
@@ -15,8 +15,7 @@ BN_generate_prime, BN_is_prime, BN_is_prime_fasttest - Generate primes and test
      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, void *), BN_CTX *ctx, void *cb_arg, int do_trial_division);
 
 =head1 DESCRIPTION
 
@@ -76,10 +75,7 @@ yields a false positive rate of at most 2^-80 for random input.
 If B<callback> is not B<NULL>, B<callback(1, j, cb_arg)> is called
 after the j-th iteration (j = 0, 1, ...). B<ctx> is a
 pre-allocated B<BN_CTX> (to save the overhead of allocating and
-freeing the structure in a loop), or B<NULL>. For
-BN_is_prime_fasttest(), B<ctx2> is a second pre-allocated B<BN_CTX> or
-B<NULL> (lacking this parameter, BN_is_prime() always has to allocate
-an additional B<CN_CTX>).
+freeing the structure in a loop), or B<NULL>.
 
 =head1 RETURN VALUES