comparison libtommath/bn_mp_exptmod_fast.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 4fbf9a7556ed
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 Y == G**X mod P, HAC pp.616, Algorithm 14.85 18 /* computes Y == G**X mod P, HAC pp.616, Algorithm 14.85
19 * 19 *
20 * Uses a left-to-right k-ary sliding window to compute the modular exponentiation. 20 * Uses a left-to-right k-ary sliding window to compute the modular exponentiation.
313 } 313 }
314 return err; 314 return err;
315 } 315 }
316 #endif 316 #endif
317 317
318
319 /* $Source: /cvs/libtom/libtommath/bn_mp_exptmod_fast.c,v $ */
320 /* $Revision: 1.3 $ */
321 /* $Date: 2006/03/31 14:18:44 $ */