Commit 1baa9490 authored by Bodo Möller's avatar Bodo Möller
Browse files

Make output of "openssl dsaparam 1024" more interesting :-)

parent 7865b871

CHANGES

+3 −1
Original line number Diff line number Diff line
@@ -31,6 +31,8 @@ 
     division before starting the Rabin-Miller test and has

     an additional BN_CTX * argument (whereas BN_is_prime always

     has to allocate at least one BN_CTX).

     'callback(1, -1, cb_arg)' is called when a number has passed the

     trial division stage.

     [Bodo Moeller]



  *) Fix for bug in CRL encoding. The validity dates weren't being handled

crypto/bn/bn_prime.c

+3 −0
Original line number Diff line number Diff line
@@ -173,9 +173,12 @@ int BN_is_prime_fasttest(BIGNUM *a, int checks, 
	if (!BN_is_odd(a))

		return(0);

	if (do_trial_division)

		{

		for (i = 1; i < NUMPRIMES; i++)

			if (BN_mod_word(a, primes[i]) == 0) 

				return 0;

		if (callback != NULL) callback(1,-1,cb_arg);

		}



	if (ctx_passed != NULL)

		ctx=ctx_passed;

doc/crypto/DSA_generate_parameters.pod

+9 −5
Original line number Diff line number Diff line
@@ -42,9 +42,11 @@ When a candidate for q is generated, B<callback(0, m++, cb_arg)> is called 


=item *



While a candidate for q is tested, B<callback(1, i, cb_arg)>

is called in the outer loop of the Miller-Rabin primality tests

(once for each witness that confirms that the candidate may be prime).

When a candidate for q has passed a test by trial division,

B<callback(1, -1, cb_arg)> is called.

While a candidate for q is tested by Miller-Rabin primality tests,

B<callback(1, i, cb_arg)> is called in the outer loop

(once for each witness that confirms that the candidate may be prime);

i is the loop counter (starting at 0).



=item *
@@ -59,8 +61,10 @@ B<callback(0, counter, cb_arg)> is called. 


=item *



While a candidate for p is tested, B<callback(1, j++, cb_arg)>

is called in the outer loop of the Miller-Rabin primality test

When a candidate for p has passed the test by trial division,

B<callback(1, -1 , cb_arg)> is called.

While it is tested by the Miller-Rabin primality test,

B<callback(1, i, cb_arg)> is called in the outer loop

(once for each witness that confirms that the candidate may be prime).

i is the loop counter (starting at 0).