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