提交 1baa9490 编写于 作者: B Bodo Möller

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

上级 7865b871
...@@ -31,7 +31,9 @@ ...@@ -31,7 +31,9 @@
division before starting the Rabin-Miller test and has division before starting the Rabin-Miller test and has
an additional BN_CTX * argument (whereas BN_is_prime always an additional BN_CTX * argument (whereas BN_is_prime always
has to allocate at least one BN_CTX). has to allocate at least one BN_CTX).
[Bodo Moeller] '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 *) Fix for bug in CRL encoding. The validity dates weren't being handled
as ASN1_TIME. as ASN1_TIME.
......
...@@ -173,9 +173,12 @@ int BN_is_prime_fasttest(BIGNUM *a, int checks, ...@@ -173,9 +173,12 @@ int BN_is_prime_fasttest(BIGNUM *a, int checks,
if (!BN_is_odd(a)) if (!BN_is_odd(a))
return(0); return(0);
if (do_trial_division) if (do_trial_division)
{
for (i = 1; i < NUMPRIMES; i++) for (i = 1; i < NUMPRIMES; i++)
if (BN_mod_word(a, primes[i]) == 0) if (BN_mod_word(a, primes[i]) == 0)
return 0; return 0;
if (callback != NULL) callback(1,-1,cb_arg);
}
if (ctx_passed != NULL) if (ctx_passed != NULL)
ctx=ctx_passed; ctx=ctx_passed;
......
...@@ -42,9 +42,11 @@ When a candidate for q is generated, B<callback(0, m++, cb_arg)> is called ...@@ -42,9 +42,11 @@ When a candidate for q is generated, B<callback(0, m++, cb_arg)> is called
=item * =item *
While a candidate for q is tested, B<callback(1, i, cb_arg)> When a candidate for q has passed a test by trial division,
is called in the outer loop of the Miller-Rabin primality tests B<callback(1, -1, cb_arg)> is called.
(once for each witness that confirms that the candidate may be prime). 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). i is the loop counter (starting at 0).
=item * =item *
...@@ -59,8 +61,10 @@ B<callback(0, counter, cb_arg)> is called. ...@@ -59,8 +61,10 @@ B<callback(0, counter, cb_arg)> is called.
=item * =item *
While a candidate for p is tested, B<callback(1, j++, cb_arg)> When a candidate for p has passed the test by trial division,
is called in the outer loop of the Miller-Rabin primality test 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). (once for each witness that confirms that the candidate may be prime).
i is the loop counter (starting at 0). i is the loop counter (starting at 0).
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册