Mercurial > dropbear

comparison libtommath/bn_mp_mulmod.c @ 398:59c7938af2bd

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
merge of '1250b8af44b62d8f4fe0f8d9fc7e7a1cc34e7e1c' and '7f8670ac3bb975f40967f3979d09d2199b7e90c8'
author Matt Johnston <matt@ucc.asn.au>
date Sat, 03 Feb 2007 08:20:30 +0000
parents 5ff8218bcee9
children 4fbf9a7556ed
comparison
equal deleted inserted replaced
396:e7c1a77d2921 398:59c7938af2bd
10 * additional optimizations in place. 10 * additional optimizations in place.
11 * 11 *
12 * The library is free for all purposes without any express 12 * The library is free for all purposes without any express
13 * guarantee it works. 13 * guarantee it works.
14 * 14 *
15 * Tom St Denis, [email protected], http://math.libtomcrypt.org 15 * Tom St Denis, [email protected], http://math.libtomcrypt.com
16 */ 16 */
17 17
18 /* d = a * b (mod c) */ 18 /* d = a * b (mod c) */
19 int 19 int mp_mulmod (mp_int * a, mp_int * b, mp_int * c, mp_int * d)
20 mp_mulmod (mp_int * a, mp_int * b, mp_int * c, mp_int * d)
21 { 20 {
22 int res; 21 int res;
23 mp_int t; 22 mp_int t;
24 23
25 if ((res = mp_init (&t)) != MP_OKAY) { 24 if ((res = mp_init (&t)) != MP_OKAY) {
33 res = mp_mod (&t, c, d); 32 res = mp_mod (&t, c, d);
34 mp_clear (&t); 33 mp_clear (&t);
35 return res; 34 return res;
36 } 35 }
37 #endif 36 #endif
37
38 /* $Source: /cvs/libtom/libtommath/bn_mp_mulmod.c,v $ */
39 /* $Revision: 1.4 $ */
40 /* $Date: 2006/03/31 14:18:44 $ */