2018-05-02 19:43:17 +00:00
|
|
|
#include "tommath_private.h"
|
2004-10-29 22:07:18 +00:00
|
|
|
#ifdef BN_MP_MULMOD_C
|
2019-04-07 13:29:11 +00:00
|
|
|
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
|
|
|
|
/* SPDX-License-Identifier: Unlicense */
|
2003-02-28 16:08:34 +00:00
|
|
|
|
|
|
|
/* d = a * b (mod c) */
|
2017-09-20 14:59:43 +00:00
|
|
|
int mp_mulmod(const mp_int *a, const mp_int *b, const mp_int *c, mp_int *d)
|
2003-02-28 16:08:34 +00:00
|
|
|
{
|
2017-08-30 17:11:35 +00:00
|
|
|
int res;
|
|
|
|
mp_int t;
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-30 17:11:35 +00:00
|
|
|
if ((res = mp_init_size(&t, c->used)) != MP_OKAY) {
|
|
|
|
return res;
|
|
|
|
}
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-30 17:11:35 +00:00
|
|
|
if ((res = mp_mul(a, b, &t)) != MP_OKAY) {
|
|
|
|
mp_clear(&t);
|
|
|
|
return res;
|
|
|
|
}
|
|
|
|
res = mp_mod(&t, c, d);
|
|
|
|
mp_clear(&t);
|
|
|
|
return res;
|
2003-02-28 16:08:34 +00:00
|
|
|
}
|
2004-10-29 22:07:18 +00:00
|
|
|
#endif
|