Mercurial > dropbear
comparison bn_mp_mod.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_MOD_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 /* c = a mod b, 0 <= c < b */ | |
19 int | |
20 mp_mod (mp_int * a, mp_int * b, mp_int * c) | |
21 { | |
22 mp_int t; | |
23 int res; | |
24 | |
25 if ((res = mp_init (&t)) != MP_OKAY) { | |
26 return res; | |
27 } | |
28 | |
29 if ((res = mp_div (a, b, NULL, &t)) != MP_OKAY) { | |
30 mp_clear (&t); | |
31 return res; | |
32 } | |
33 | |
34 if (t.sign != b->sign) { | |
35 res = mp_add (b, &t, c); | |
36 } else { | |
37 res = MP_OKAY; | |
38 mp_exch (&t, c); | |
39 } | |
40 | |
41 mp_clear (&t); | |
42 return res; | |
43 } | |
44 #endif |