libtommath/bn_mp_mod.c

48 lines
1.1 KiB
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 22:07:18 +00:00
#ifdef BN_MP_MOD_C
2003-02-28 16:08:34 +00:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
2003-08-05 01:24:44 +00:00
* LibTomMath is a library that provides multiple-precision
2003-02-28 16:08:34 +00:00
* integer arithmetic as well as number theoretic functionality.
*
2003-08-05 01:24:44 +00:00
* The library was designed directly after the MPI library by
2003-02-28 16:08:34 +00:00
* Michael Fromberger but has been written from scratch with
* additional optimizations in place.
*
* The library is free for all purposes without any express
* guarantee it works.
*
* Tom St Denis, tstdenis82@gmail.com, http://libtom.org
2003-02-28 16:08:34 +00:00
*/
/* c = a mod b, 0 <= c < b if b > 0, b < c <= 0 if b < 0 */
2017-09-20 14:59:43 +00:00
int mp_mod(const mp_int *a, const mp_int *b, mp_int *c)
2003-02-28 16:08:34 +00:00
{
2017-08-30 17:11:35 +00:00
mp_int t;
int res;
2003-02-28 16:08:34 +00:00
2017-08-30 17:11:35 +00:00
if ((res = mp_init_size(&t, b->used)) != MP_OKAY) {
return res;
}
2003-02-28 16:08:34 +00:00
2017-08-30 17:11:35 +00:00
if ((res = mp_div(a, b, NULL, &t)) != MP_OKAY) {
mp_clear(&t);
return res;
}
2003-02-28 16:08:34 +00:00
2017-08-30 17:11:35 +00:00
if ((mp_iszero(&t) != MP_NO) || (t.sign == b->sign)) {
res = MP_OKAY;
mp_exch(&t, c);
} else {
res = mp_add(b, &t, c);
}
2003-02-28 16:08:34 +00:00
2017-08-30 17:11:35 +00:00
mp_clear(&t);
return res;
2003-02-28 16:08:34 +00:00
}
2004-10-29 22:07:18 +00:00
#endif
2005-08-01 16:37:28 +00:00
2017-08-28 14:27:26 +00:00
/* ref: $Format:%D$ */
/* git commit: $Format:%H$ */
/* commit time: $Format:%ai$ */