comparison libtommath/bn_fast_mp_montgomery_reduce.c @ 435:337c45621e81

merge of 'a9b0496634cdd25647b65e585cc3240f3fa699ee' and 'c22be8b8f570b48e9662dac32c7b3e7148a42206'
author Matt Johnston <matt@ucc.asn.au>
date Thu, 22 Feb 2007 14:53:49 +0000
parents 5ff8218bcee9
children 60fc6476e044
comparison
equal deleted inserted replaced
434:0aaaf68e97dc 435:337c45621e81
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 /* computes xR**-1 == x (mod N) via Montgomery Reduction 18 /* computes xR**-1 == x (mod N) via Montgomery Reduction
19 * 19 *
20 * This is an optimized implementation of montgomery_reduce 20 * This is an optimized implementation of montgomery_reduce
164 return s_mp_sub (x, n, x); 164 return s_mp_sub (x, n, x);
165 } 165 }
166 return MP_OKAY; 166 return MP_OKAY;
167 } 167 }
168 #endif 168 #endif
169
170 /* $Source: /cvs/libtom/libtommath/bn_fast_mp_montgomery_reduce.c,v $ */
171 /* $Revision: 1.3 $ */
172 /* $Date: 2006/03/31 14:18:44 $ */