comparison bn_mp_reduce_2k.c @ 386:97db060d0ef5 libtommath-orig libtommath-0.40

Update to LibTomMath 0.40
author Matt Johnston <matt@ucc.asn.au>
date Thu, 11 Jan 2007 03:11:15 +0000
parents 91fbc376f010
children
comparison
equal deleted inserted replaced
282:91fbc376f010 386:97db060d0ef5
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 /* reduces a modulo n where n is of the form 2**p - d */ 18 /* reduces a modulo n where n is of the form 2**p - d */
19 int mp_reduce_2k(mp_int *a, mp_int *n, mp_digit d) 19 int mp_reduce_2k(mp_int *a, mp_int *n, mp_digit d)
20 { 20 {
53 mp_clear(&q); 53 mp_clear(&q);
54 return res; 54 return res;
55 } 55 }
56 56
57 #endif 57 #endif
58
59 /* $Source: /cvs/libtom/libtommath/bn_mp_reduce_2k.c,v $ */
60 /* $Revision: 1.3 $ */
61 /* $Date: 2006/03/31 14:18:44 $ */