Lines Matching defs:r
55 /* Fast modular reduction for p384 = 2^384 - 2^128 - 2^96 + 2^32 - 1. a can be r.
59 ec_GFp_nistp384_mod(const mp_int *a, mp_int *r, const GFMethod *meth)
90 MP_CHECKOK(mp_mod(a, &meth->irr, r));
176 MP_CHECKOK(mp_add(&m[0], &m[1], r));
177 MP_CHECKOK(mp_add(r, &m[1], r));
178 MP_CHECKOK(mp_add(r, &m[2], r));
179 MP_CHECKOK(mp_add(r, &m[3], r));
180 MP_CHECKOK(mp_add(r, &m[4], r));
181 MP_CHECKOK(mp_add(r, &m[5], r));
182 MP_CHECKOK(mp_add(r, &m[6], r));
183 MP_CHECKOK(mp_sub(r, &m[7], r));
184 MP_CHECKOK(mp_sub(r, &m[8], r));
185 MP_CHECKOK(mp_submod(r, &m[9], &meth->irr, r));
186 s_mp_clamp(r);
192 MP_CHECKOK(mp_mod(a, &meth->irr, r));
245 MP_CHECKOK(mp_add(&m[0], &m[1], r));
246 MP_CHECKOK(mp_add(r, &m[1], r));
247 MP_CHECKOK(mp_add(r, &m[2], r));
248 MP_CHECKOK(mp_add(r, &m[3], r));
249 MP_CHECKOK(mp_add(r, &m[4], r));
250 MP_CHECKOK(mp_add(r, &m[5], r));
251 MP_CHECKOK(mp_add(r, &m[6], r));
252 MP_CHECKOK(mp_sub(r, &m[7], r));
253 MP_CHECKOK(mp_sub(r, &m[8], r));
254 MP_CHECKOK(mp_submod(r, &m[9], &meth->irr, r));
255 s_mp_clamp(r);
264 * result in r. r could be a. Uses optimized modular reduction for p384.
267 ec_GFp_nistp384_sqr(const mp_int *a, mp_int *r, const GFMethod *meth)
271 MP_CHECKOK(mp_sqr(a, r));
272 MP_CHECKOK(ec_GFp_nistp384_mod(r, r, meth));
278 * Store the result in r. r could be a or b; a could be b. Uses
281 ec_GFp_nistp384_mul(const mp_int *a, const mp_int *b, mp_int *r,
286 MP_CHECKOK(mp_mul(a, b, r));
287 MP_CHECKOK(ec_GFp_nistp384_mod(r, r, meth));