comparison libtommath/bn_mp_exptmod_fast.c @ 351:e66eec4dcba7 debug-unrandom

some more debugging output
author Matt Johnston <matt@ucc.asn.au>
date Tue, 08 Aug 2006 15:31:38 +0000
parents cd14c94fe89c
children 2481bc4370b8
comparison
equal deleted inserted replaced
348:cd14c94fe89c 351:e66eec4dcba7
39 /* use a pointer to the reduction algorithm. This allows us to use 39 /* use a pointer to the reduction algorithm. This allows us to use
40 * one of many reduction algorithms without modding the guts of 40 * one of many reduction algorithms without modding the guts of
41 * the code with if statements everywhere. 41 * the code with if statements everywhere.
42 */ 42 */
43 int (*redux)(mp_int*,mp_int*,mp_digit); 43 int (*redux)(mp_int*,mp_int*,mp_digit);
44
45 print_mp_int("mp_exptmod_fast G", G);
46 print_mp_int("mp_exptmod_fast X", X);
47 print_mp_int("mp_exptmod_fast P", P);
44 48
45 /* find window size */ 49 /* find window size */
46 x = mp_count_bits (X); 50 x = mp_count_bits (X);
47 if (x <= 7) { 51 if (x <= 7) {
48 winsize = 2; 52 winsize = 2;