* general that's slightly more fiddly to arrange. By choosing
* a prime e, we can simplify the criterion.)
*/
* general that's slightly more fiddly to arrange. By choosing
* a prime e, we can simplify the criterion.)
*/
key->p = primegen(bits / 2, RSA_EXPONENT, 1, NULL,
key->p = primegen(bits / 2, RSA_EXPONENT, 1, NULL,
key->q = primegen(bits - bits / 2, RSA_EXPONENT, 1, NULL,
key->q = primegen(bits - bits / 2, RSA_EXPONENT, 1, NULL,
pfn(pfnparam, PROGFN_PROGRESS, 3, 4);
key->iqmp = modinv(key->q, key->p);
pfn(pfnparam, PROGFN_PROGRESS, 3, 4);
key->iqmp = modinv(key->q, key->p);
pfn(pfnparam, PROGFN_PROGRESS, 3, 5);
/*
pfn(pfnparam, PROGFN_PROGRESS, 3, 5);
/*