Mercurial > dropbear

comparison bn_mp_reduce_setup.c @ 142:d29b64170cf0 libtommath-orig

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
import of libtommath 0.32
author Matt Johnston <matt@ucc.asn.au>
date Sun, 19 Dec 2004 11:33:56 +0000
parents 86e0b50a9b58
children
comparison
equal deleted inserted replaced
19:e1037a1e12e7 142:d29b64170cf0
1 #include <tommath.h>
2 #ifdef BN_MP_REDUCE_SETUP_C
1 /* LibTomMath, multiple-precision integer library -- Tom St Denis 3 /* LibTomMath, multiple-precision integer library -- Tom St Denis
2 * 4 *
3 * LibTomMath is a library that provides multiple-precision 5 * LibTomMath is a library that provides multiple-precision
4 * integer arithmetic as well as number theoretic functionality. 6 * integer arithmetic as well as number theoretic functionality.
5 * 7 *
10 * The library is free for all purposes without any express 12 * The library is free for all purposes without any express
11 * guarantee it works. 13 * guarantee it works.
12 * 14 *
13 * Tom St Denis, [email protected], http://math.libtomcrypt.org 15 * Tom St Denis, [email protected], http://math.libtomcrypt.org
14 */ 16 */
15 #include <tommath.h>
16 17
17 /* pre-calculate the value required for Barrett reduction 18 /* pre-calculate the value required for Barrett reduction
18 * For a given modulus "b" it calulates the value required in "a" 19 * For a given modulus "b" it calulates the value required in "a"
19 */ 20 */
20 int 21 int mp_reduce_setup (mp_int * a, mp_int * b)
21 mp_reduce_setup (mp_int * a, mp_int * b)
22 { 22 {
23 int res; 23 int res;
24 24
25 if ((res = mp_2expt (a, b->used * 2 * DIGIT_BIT)) != MP_OKAY) { 25 if ((res = mp_2expt (a, b->used * 2 * DIGIT_BIT)) != MP_OKAY) {
26 return res; 26 return res;
27 } 27 }
28 return mp_div (a, b, a, NULL); 28 return mp_div (a, b, a, NULL);
29 } 29 }
30 #endif