Lines Matching full:multiply
171 mp_err s_mp_mul_2d(mp_int *mp, mp_digit d); /* multiply by 2^d in place*/
173 mp_err s_mp_mul_2(mp_int *mp); /* multiply by 2 in place */
177 mp_err s_mp_mul_d(mp_int *mp, mp_digit d); /* unsigned digit multiply */
184 mp_err s_mp_mul(mp_int *a, mp_int *b); /* magnitude multiply */
187 /* multiply buffers in place */
1259 standard iterative square-and-multiply technique.
1626 Compute c = (a ** b) mod m. Uses a standard square-and-multiply
2964 Multiply by the integer 2^d, where d is a number of bits. This
3056 We multiply by the smallest power of 2 that gives us a leading digit
