2022-10-22 18:41:00 +08:00
|
|
|
/* TomsFastMath, a fast ISO C bignum library.
|
|
|
|
|
*
|
|
|
|
|
* This project is meant to fill in where LibTomMath
|
|
|
|
|
* falls short. That is speed ;-)
|
|
|
|
|
*
|
|
|
|
|
* This project is public domain and free for all purposes.
|
|
|
|
|
*
|
|
|
|
|
* Tom St Denis, tomstdenis@gmail.com
|
|
|
|
|
*/
|
2023-01-14 18:28:39 +08:00
|
|
|
#include <tfm_private.h>
|
2022-10-22 18:41:00 +08:00
|
|
|
/* d = a * b (mod c) */
|
|
|
|
|
int fp_mulmod(fp_int *a, fp_int *b, fp_int *c, fp_int *d)
|
|
|
|
|
{
|
|
|
|
|
fp_int tmp;
|
|
|
|
|
fp_zero(&tmp);
|
|
|
|
|
fp_mul(a, b, &tmp);
|
|
|
|
|
return fp_mod(&tmp, c, d);
|
|
|
|
|
}
|
|
|
|
|
|
2023-01-14 18:28:39 +08:00
|
|
|
/* $Source$ */
|
|
|
|
|
/* $Revision$ */
|
|
|
|
|
/* $Date$ */
|
