}
/* q is a prime, with overwhelming probability. */
+ if (progress)
+ progress(progress_ctx, '\n');
+
{
unsigned size = (n+1) * SHA1_DIGEST_SIZE;
uint8_t *buffer = alloca(size);
if (mpz_probab_prime_p(p, 5))
{
/* Done! */
+ if (progress)
+ progress(progress_ctx, '\n');
+
mpz_clear(s);
mpz_clear(t);
mpz_clear(c);
if (mpz_cmp_ui(g, 1))
{
/* g != 1. Finished. */
+ if (progress)
+ progress(progress_ctx, '\n');
+
mpz_clear(e);
mpz_clear(n);
{
mpz_t t;
- if (bits < DSA_MINIMUM_BITS)
+ if (bits < DSA_MIN_P_BITS)
return 0;
dsa_nist_gen(pub->p, pub->q,