comparison bn_mp_submod.c @ 282:91fbc376f010 libtommath-orig libtommath-0.35

Import of libtommath 0.35 From ltm-0.35.tar.bz2 SHA1 of 3f193dbae9351e92d02530994fa18236f7fde01c
author Matt Johnston <matt@ucc.asn.au>
date Wed, 08 Mar 2006 13:16:18 +0000
parents
children 97db060d0ef5
comparison
equal deleted inserted replaced
-1:000000000000 282:91fbc376f010
1 #include <tommath.h>
2 #ifdef BN_MP_SUBMOD_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_submod (mp_int * a, mp_int * b, mp_int * c, mp_int * d)
21 {
22 int res;
23 mp_int t;
24
25
26 if ((res = mp_init (&t)) != MP_OKAY) {
27 return res;
28 }
29
30 if ((res = mp_sub (a, b, &t)) != MP_OKAY) {
31 mp_clear (&t);
32 return res;
33 }
34 res = mp_mod (&t, c, d);
35 mp_clear (&t);
36 return res;
37 }
38 #endif