Mercurial > dropbear
comparison bn_mp_mulmod.c @ 2:86e0b50a9b58 libtommath-orig ltm-0.30-orig
ltm 0.30 orig import
author | Matt Johnston <matt@ucc.asn.au> |
---|---|
date | Mon, 31 May 2004 18:25:22 +0000 |
parents | |
children | d29b64170cf0 |
comparison
equal
deleted
inserted
replaced
-1:000000000000 | 2:86e0b50a9b58 |
---|---|
1 /* LibTomMath, multiple-precision integer library -- Tom St Denis | |
2 * | |
3 * LibTomMath is a library that provides multiple-precision | |
4 * integer arithmetic as well as number theoretic functionality. | |
5 * | |
6 * The library was designed directly after the MPI library by | |
7 * Michael Fromberger but has been written from scratch with | |
8 * additional optimizations in place. | |
9 * | |
10 * The library is free for all purposes without any express | |
11 * guarantee it works. | |
12 * | |
13 * Tom St Denis, [email protected], http://math.libtomcrypt.org | |
14 */ | |
15 #include <tommath.h> | |
16 | |
17 /* d = a * b (mod c) */ | |
18 int | |
19 mp_mulmod (mp_int * a, mp_int * b, mp_int * c, mp_int * d) | |
20 { | |
21 int res; | |
22 mp_int t; | |
23 | |
24 if ((res = mp_init (&t)) != MP_OKAY) { | |
25 return res; | |
26 } | |
27 | |
28 if ((res = mp_mul (a, b, &t)) != MP_OKAY) { | |
29 mp_clear (&t); | |
30 return res; | |
31 } | |
32 res = mp_mod (&t, c, d); | |
33 mp_clear (&t); | |
34 return res; | |
35 } |