libtommath/bn_mp_mulmod.c

41 lines
952 B
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 22:07:18 +00:00
#ifdef BN_MP_MULMOD_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
*/
/* d = a * b (mod c) */
2005-08-01 16:37:28 +00:00
int mp_mulmod (mp_int * a, mp_int * b, mp_int * c, mp_int * d)
2003-02-28 16:08:34 +00:00
{
2003-02-28 16:09:08 +00:00
int res;
mp_int t;
2003-02-28 16:08:34 +00:00
2017-06-24 14:48:10 +00:00
if ((res = mp_init_size (&t, c->used)) != MP_OKAY) {
2003-02-28 16:08:34 +00:00
return res;
}
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;
}
2004-10-29 22:07:18 +00:00
#endif
2005-08-01 16:37:28 +00:00
/* $Source$ */
/* $Revision$ */
/* $Date$ */