void *pfnparam)
{
Bignum qm1, power, g, h, tmp;
+ unsigned pfirst, qfirst;
int progress;
/*
pfn(pfnparam, PROGFN_READY, 0, 0);
+ invent_firstbits(&pfirst, &qfirst);
/*
* Generate q: a prime of length 160.
*/
- key->q = primegen(160, 2, 2, NULL, 1, pfn, pfnparam);
+ key->q = primegen(160, 2, 2, NULL, 1, pfn, pfnparam, qfirst);
/*
* Now generate p: a prime of length `bits', such that p-1 is
* divisible by q.
*/
- key->p = primegen(bits-160, 2, 2, key->q, 2, pfn, pfnparam);
+ key->p = primegen(bits-160, 2, 2, key->q, 2, pfn, pfnparam, pfirst);
/*
* Next we need g. Raise 2 to the power (p-1)/q modulo p, and