Mercurial > dropbear
comparison bn_fast_mp_montgomery_reduce.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 /* 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 $ */ |