mirror of
http://galexander.org/git/simplesshd.git
synced 2024-11-18 05:18:47 +00:00
41 lines
1.0 KiB
C
41 lines
1.0 KiB
C
|
#include <tommath.h>
|
||
|
|
#ifdef BN_MP_MULMOD_C
|
||
|
|
/* LibTomMath, multiple-precision integer library -- Tom St Denis
|
||
|
|
*
|
||
|
|
* LibTomMath is a library that provides multiple-precision
|
||
|
|
* integer arithmetic as well as number theoretic functionality.
|
||
|
|
*
|
||
|
|
* The library was designed directly after the MPI library by
|
||
|
|
* 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, tomstdenis@gmail.com, http://math.libtomcrypt.com
|
||
|
|
*/
|
||
|
|
|
||
|
|
/* d = a * b (mod c) */
|
||
|
|
int mp_mulmod (mp_int * a, mp_int * b, mp_int * c, mp_int * d)
|
||
|
|
{
|
||
|
|
int res;
|
||
|
|
mp_int t;
|
||
|
|
|
||
|
|
if ((res = mp_init_size (&t, c->used)) != MP_OKAY) {
|
||
|
|
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;
|
||
|
|
}
|
||
|
|
#endif
|
||
|
|
|
||
|
|
/* $Source: /cvs/libtom/libtommath/bn_mp_mulmod.c,v $ */
|
||
|
|
/* $Revision: 1.4 $ */
|
||
|
|
/* $Date: 2006/03/31 14:18:44 $ */
|