comparison libtommath/bn_mp_reduce_2k_l.c @ 398:59c7938af2bd

merge of '1250b8af44b62d8f4fe0f8d9fc7e7a1cc34e7e1c' and '7f8670ac3bb975f40967f3979d09d2199b7e90c8'
author Matt Johnston <matt@ucc.asn.au>
date Sat, 03 Feb 2007 08:20:30 +0000
parents 5ff8218bcee9
children 60fc6476e044
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 /* 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 This differs from reduce_2k since "d" can be larger 19 This differs from reduce_2k since "d" can be larger
20 than a single digit. 20 than a single digit.
54 mp_clear(&q); 54 mp_clear(&q);
55 return res; 55 return res;
56 } 56 }
57 57
58 #endif 58 #endif
59
60 /* $Source: /cvs/libtom/libtommath/bn_mp_reduce_2k_l.c,v $ */
61 /* $Revision: 1.3 $ */
62 /* $Date: 2006/03/31 14:18:44 $ */