Home | History | Annotate | Download | only in hcrypto

Lines Matching defs:iqmp

64 			  fp_int * dmp1, fp_int * dmq1, fp_int * iqmp,
78 /* C2 = 1/q mod p (iqmp) */
83 fp_mul(&u, iqmp, &u);
273 if (rsa->p && rsa->q && rsa->dmp1 && rsa->dmq1 && rsa->iqmp) {
274 fp_int p, q, dmp1, dmq1, iqmp;
280 BN2mpz(&iqmp, rsa->iqmp);
282 res = tfm_rsa_private_calculate(&in, &p, &q, &dmp1, &dmq1, &iqmp, &out);
284 fp_zero_multi(&p, &q, &dmp1, &dmq1, &iqmp, NULL);
344 if (rsa->p && rsa->q && rsa->dmp1 && rsa->dmq1 && rsa->iqmp) {
345 fp_int p, q, dmp1, dmq1, iqmp;
351 BN2mpz(&iqmp, rsa->iqmp);
353 res = tfm_rsa_private_calculate(&in, &p, &q, &dmp1, &dmq1, &iqmp, &out);
355 fp_zero_multi(&p, &q, &dmp1, &dmq1, &iqmp, NULL);
449 fp_int el, p, q, n, d, dmp1, dmq1, iqmp, t1, t2, t3;
459 fp_init_multi(&el, &p, &q, &n, &n, &d, &dmp1, &dmq1, &iqmp, &t1, &t2, &t3, NULL);
512 /* calculate iqmp iqmp = 1/q mod p */
513 fp_invmod(&q, &p, &iqmp);
524 rsa->iqmp = mpz2BN(&iqmp);
530 &dmq1, &iqmp, &t1, &t2, &t3, NULL);