comparison bn_fast_mp_invmod.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 the modular inverse via binary extended euclidean algorithm, 18 /* computes the modular inverse via binary extended euclidean algorithm,
19 * that is c = 1/a mod b 19 * that is c = 1/a mod b
20 * 20 *
140 140
141 LBL_ERR:mp_clear_multi (&x, &y, &u, &v, &B, &D, NULL); 141 LBL_ERR:mp_clear_multi (&x, &y, &u, &v, &B, &D, NULL);
142 return res; 142 return res;
143 } 143 }
144 #endif 144 #endif
145
146 /* $Source: /cvs/libtom/libtommath/bn_fast_mp_invmod.c,v $ */
147 /* $Revision: 1.3 $ */
148 /* $Date: 2006/03/31 14:18:44 $ */