Home | History | Annotate | Download | only in hcrypto

Lines Matching defs:iqmp

106 			  mp_int * dmp1, mp_int * dmq1, mp_int * iqmp,
120 /* C2 = 1/q mod p (iqmp) */
125 mp_mul(&u, iqmp, &u);
340 if (rsa->p && rsa->q && rsa->dmp1 && rsa->dmq1 && rsa->iqmp) {
341 mp_int p, q, dmp1, dmq1, iqmp;
343 mp_init_multi(&p, &q, &dmp1, &dmq1, &iqmp, NULL);
349 BN2mpz(&iqmp, rsa->iqmp);
351 res = ltm_rsa_private_calculate(&in, &p, &q, &dmp1, &dmq1, &iqmp, &out);
353 mp_clear_multi(&p, &q, &dmp1, &dmq1, &iqmp, NULL);
428 if (rsa->p && rsa->q && rsa->dmp1 && rsa->dmq1 && rsa->iqmp) {
429 mp_int p, q, dmp1, dmq1, iqmp;
431 mp_init_multi(&p, &q, &dmp1, &dmq1, &iqmp, NULL);
437 BN2mpz(&iqmp, rsa->iqmp);
439 res = ltm_rsa_private_calculate(&in, &p, &q, &dmp1, &dmq1, &iqmp, &out);
441 mp_clear_multi(&p, &q, &dmp1, &dmq1, &iqmp, NULL);
520 mp_int el, p, q, n, d, dmp1, dmq1, iqmp, t1, t2, t3;
531 &dmp1, &dmq1, &iqmp,
585 /* calculate iqmp iqmp = 1/q mod p */
586 mp_invmod(&q, &p, &iqmp);
597 rsa->iqmp = mpz2BN(&iqmp);
603 &dmp1, &dmq1, &iqmp,