Lines Matching defs:p
349 * f(t) = t^p[0] + t^p[1] + ... + t^p[k]
350 * where m = p[0] > p[1] > ... > p[k] = 0.
353 mp_bmod(const mp_int *a, const unsigned int p[], mp_int *r)
370 dN = p[0] / MP_DIGIT_BITS;
381 for (k = 1; p[k] > 0; k++) {
382 /* reducing component t^p[k] */
383 n = p[0] - p[k];
394 d0 = p[0] % MP_DIGIT_BITS;
405 d0 = p[0] % MP_DIGIT_BITS;
414 for (k = 1; p[k] > 0; k++) {
415 /* reducing component t^p[k]*/
416 n = p[k] / MP_DIGIT_BITS;
417 d0 = p[k] % MP_DIGIT_BITS;
431 /* Compute the product of two polynomials a and b, reduce modulo p,
435 mp_bmulmod(const mp_int *a, const mp_int *b, const unsigned int p[], mp_int *r)
439 if (a == b) return mp_bsqrmod(a, p, r);
442 return mp_bmod(r, p, r);
445 /* Compute binary polynomial squaring c = a*a mod p .
450 mp_bsqrmod(const mp_int *a, const unsigned int p[], mp_int *r)
479 MP_CHECKOK( mp_bmod(r, p, r) );
488 /* Compute binary polynomial y/x mod p, y divided by x, reduce modulo p.
496 const unsigned int p[], mp_int *r)
513 /* reduce x and y mod p */
514 MP_CHECKOK( mp_bmod(a, p, a) );
515 MP_CHECKOK( mp_bmod(u, p, u) );
569 mp_bpoly2arr(const mp_int *a, unsigned int p[], int max)
577 for (k = 0; k < max; k++) p[k] = 0;
584 if (k < max) p[k] = MP_DIGIT_BIT * i + j;
598 mp_barr2poly(const unsigned int p[], mp_int *a)
605 for (i = 0; p[i] > 0; i++) {
606 MP_CHECKOK( mpl_set_bit(a, p[i], 1) );