diff options
Diffstat (limited to 'libtommath/pre_gen')
| -rw-r--r-- | libtommath/pre_gen/mpi.c | 734 |
1 files changed, 360 insertions, 374 deletions
diff --git a/libtommath/pre_gen/mpi.c b/libtommath/pre_gen/mpi.c index d915a58..62ec029 100644 --- a/libtommath/pre_gen/mpi.c +++ b/libtommath/pre_gen/mpi.c @@ -13,7 +13,7 @@ * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ static const struct { @@ -44,8 +44,8 @@ char *mp_error_to_string(int code) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_error.c */ @@ -64,7 +64,7 @@ char *mp_error_to_string(int code) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* computes the modular inverse via binary extended euclidean algorithm, @@ -196,8 +196,8 @@ LBL_ERR:mp_clear_multi (&x, &y, &u, &v, &B, &D, NULL); #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_fast_mp_invmod.c */ @@ -216,7 +216,7 @@ LBL_ERR:mp_clear_multi (&x, &y, &u, &v, &B, &D, NULL); * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* computes xR**-1 == x (mod N) via Montgomery Reduction @@ -372,8 +372,8 @@ int fast_mp_montgomery_reduce (mp_int * x, mp_int * n, mp_digit rho) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_fast_mp_montgomery_reduce.c */ @@ -392,7 +392,7 @@ int fast_mp_montgomery_reduce (mp_int * x, mp_int * n, mp_digit rho) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* Fast (comba) multiplier @@ -458,10 +458,7 @@ int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs) /* make next carry */ _W = _W >> ((mp_word)DIGIT_BIT); - } - - /* store final carry */ - W[ix] = (mp_digit)(_W & MP_MASK); + } /* setup dest */ olduse = c->used; @@ -486,8 +483,8 @@ int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_fast_s_mp_mul_digs.c */ @@ -506,7 +503,7 @@ int fast_s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* this is a modified version of fast_s_mul_digs that only produces @@ -564,9 +561,6 @@ int fast_s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs) _W = _W >> ((mp_word)DIGIT_BIT); } - /* store final carry */ - W[ix] = (mp_digit)(_W & MP_MASK); - /* setup dest */ olduse = c->used; c->used = pa; @@ -591,8 +585,8 @@ int fast_s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_fast_s_mp_mul_high_digs.c */ @@ -611,7 +605,7 @@ int fast_s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* the jist of squaring... @@ -709,8 +703,8 @@ int fast_s_mp_sqr (mp_int * a, mp_int * b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_fast_s_mp_sqr.c */ @@ -729,7 +723,7 @@ int fast_s_mp_sqr (mp_int * a, mp_int * b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* computes a = 2**b @@ -761,8 +755,8 @@ mp_2expt (mp_int * a, int b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_2expt.c */ @@ -781,7 +775,7 @@ mp_2expt (mp_int * a, int b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* b = |a| @@ -808,8 +802,8 @@ mp_abs (mp_int * a, mp_int * b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_abs.c */ @@ -828,7 +822,7 @@ mp_abs (mp_int * a, mp_int * b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* high level addition (handles signs) */ @@ -865,8 +859,8 @@ int mp_add (mp_int * a, mp_int * b, mp_int * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_add.c */ @@ -885,7 +879,7 @@ int mp_add (mp_int * a, mp_int * b, mp_int * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* single digit addition */ @@ -981,8 +975,8 @@ mp_add_d (mp_int * a, mp_digit b, mp_int * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_add_d.c */ @@ -1001,7 +995,7 @@ mp_add_d (mp_int * a, mp_digit b, mp_int * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* d = a + b (mod c) */ @@ -1026,8 +1020,8 @@ mp_addmod (mp_int * a, mp_int * b, mp_int * c, mp_int * d) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_addmod.c */ @@ -1046,7 +1040,7 @@ mp_addmod (mp_int * a, mp_int * b, mp_int * c, mp_int * d) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* AND two ints together */ @@ -1087,8 +1081,8 @@ mp_and (mp_int * a, mp_int * b, mp_int * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_and.c */ @@ -1107,7 +1101,7 @@ mp_and (mp_int * a, mp_int * b, mp_int * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* trim unused digits @@ -1135,8 +1129,8 @@ mp_clamp (mp_int * a) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_clamp.c */ @@ -1155,7 +1149,7 @@ mp_clamp (mp_int * a) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* clear one (frees) */ @@ -1183,8 +1177,8 @@ mp_clear (mp_int * a) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_clear.c */ @@ -1203,7 +1197,7 @@ mp_clear (mp_int * a) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ #include <stdarg.h> @@ -1221,8 +1215,8 @@ void mp_clear_multi(mp_int *mp, ...) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_clear_multi.c */ @@ -1241,7 +1235,7 @@ void mp_clear_multi(mp_int *mp, ...) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* compare two ints (signed)*/ @@ -1268,8 +1262,8 @@ mp_cmp (mp_int * a, mp_int * b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_cmp.c */ @@ -1288,7 +1282,7 @@ mp_cmp (mp_int * a, mp_int * b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* compare a digit */ @@ -1316,8 +1310,8 @@ int mp_cmp_d(mp_int * a, mp_digit b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_cmp_d.c */ @@ -1336,7 +1330,7 @@ int mp_cmp_d(mp_int * a, mp_digit b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* compare maginitude of two ints (unsigned) */ @@ -1375,8 +1369,8 @@ int mp_cmp_mag (mp_int * a, mp_int * b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_cmp_mag.c */ @@ -1395,7 +1389,7 @@ int mp_cmp_mag (mp_int * a, mp_int * b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ static const int lnz[16] = { @@ -1432,8 +1426,8 @@ int mp_cnt_lsb(mp_int *a) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_cnt_lsb.c */ @@ -1452,7 +1446,7 @@ int mp_cnt_lsb(mp_int *a) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* copy, b = a */ @@ -1504,8 +1498,8 @@ mp_copy (mp_int * a, mp_int * b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_copy.c */ @@ -1524,7 +1518,7 @@ mp_copy (mp_int * a, mp_int * b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* returns the number of bits in an int */ @@ -1553,8 +1547,8 @@ mp_count_bits (mp_int * a) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_count_bits.c */ @@ -1573,7 +1567,7 @@ mp_count_bits (mp_int * a) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ #ifdef BN_MP_DIV_SMALL @@ -1849,8 +1843,8 @@ LBL_Q:mp_clear (&q); #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_div.c */ @@ -1869,7 +1863,7 @@ LBL_Q:mp_clear (&q); * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* b = a/2 */ @@ -1921,8 +1915,8 @@ int mp_div_2(mp_int * a, mp_int * b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_div_2.c */ @@ -1941,7 +1935,7 @@ int mp_div_2(mp_int * a, mp_int * b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* shift right by a certain bit count (store quotient in c, optional remainder in d) */ @@ -2022,8 +2016,8 @@ int mp_div_2d (mp_int * a, int b, mp_int * c, mp_int * d) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_div_2d.c */ @@ -2042,7 +2036,7 @@ int mp_div_2d (mp_int * a, int b, mp_int * c, mp_int * d) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* divide by three (based on routine from MPI and the GMP manual) */ @@ -2105,8 +2099,8 @@ mp_div_3 (mp_int * a, mp_int *c, mp_digit * d) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_div_3.c */ @@ -2125,7 +2119,7 @@ mp_div_3 (mp_int * a, mp_int *c, mp_digit * d) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ static int s_is_power_of_two(mp_digit b, int *p) @@ -2219,8 +2213,8 @@ int mp_div_d (mp_int * a, mp_digit b, mp_int * c, mp_digit * d) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_div_d.c */ @@ -2239,7 +2233,7 @@ int mp_div_d (mp_int * a, mp_digit b, mp_int * c, mp_digit * d) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* determines if a number is a valid DR modulus */ @@ -2266,8 +2260,8 @@ int mp_dr_is_modulus(mp_int *a) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_dr_is_modulus.c */ @@ -2286,7 +2280,7 @@ int mp_dr_is_modulus(mp_int *a) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* reduce "x" in place modulo "n" using the Diminished Radix algorithm. @@ -2364,8 +2358,8 @@ top: #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_dr_reduce.c */ @@ -2384,7 +2378,7 @@ top: * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* determines the setup value */ @@ -2400,8 +2394,8 @@ void mp_dr_setup(mp_int *a, mp_digit *d) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_dr_setup.c */ @@ -2420,7 +2414,7 @@ void mp_dr_setup(mp_int *a, mp_digit *d) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* swap the elements of two integers, for cases where you can't simply swap the @@ -2438,8 +2432,8 @@ mp_exch (mp_int * a, mp_int * b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_exch.c */ @@ -2458,7 +2452,7 @@ mp_exch (mp_int * a, mp_int * b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* calculate c = a**b using a square-multiply algorithm */ @@ -2499,8 +2493,8 @@ int mp_expt_d (mp_int * a, mp_digit b, mp_int * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_expt_d.c */ @@ -2519,7 +2513,7 @@ int mp_expt_d (mp_int * a, mp_digit b, mp_int * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ @@ -2615,8 +2609,8 @@ int mp_exptmod (mp_int * G, mp_int * X, mp_int * P, mp_int * Y) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_exptmod.c */ @@ -2635,7 +2629,7 @@ int mp_exptmod (mp_int * G, mp_int * X, mp_int * P, mp_int * Y) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* computes Y == G**X mod P, HAC pp.616, Algorithm 14.85 @@ -2940,8 +2934,8 @@ LBL_M: /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_exptmod_fast.c */ @@ -2960,7 +2954,7 @@ LBL_M: * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* Extended euclidean algorithm of (a, b) produces @@ -3026,8 +3020,8 @@ _ERR: mp_clear_multi(&u1, &u2, &u3, &v1, &v2, &v3, &t1, &t2, &t3, &q, &tmp, NULL #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_exteuclid.c */ @@ -3046,7 +3040,7 @@ _ERR: mp_clear_multi(&u1, &u2, &u3, &v1, &v2, &v3, &t1, &t2, &t3, &q, &tmp, NULL * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* read a bigint from a file stream in ASCII */ @@ -3097,8 +3091,8 @@ int mp_fread(mp_int *a, int radix, FILE *stream) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_fread.c */ @@ -3117,7 +3111,7 @@ int mp_fread(mp_int *a, int radix, FILE *stream) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ int mp_fwrite(mp_int *a, int radix, FILE *stream) @@ -3153,8 +3147,8 @@ int mp_fwrite(mp_int *a, int radix, FILE *stream) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_fwrite.c */ @@ -3173,7 +3167,7 @@ int mp_fwrite(mp_int *a, int radix, FILE *stream) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* Greatest Common Divisor using the binary method */ @@ -3183,21 +3177,13 @@ int mp_gcd (mp_int * a, mp_int * b, mp_int * c) int k, u_lsb, v_lsb, res; /* either zero than gcd is the largest */ - if (mp_iszero (a) == 1 && mp_iszero (b) == 0) { + if (mp_iszero (a) == MP_YES) { return mp_abs (b, c); } - if (mp_iszero (a) == 0 && mp_iszero (b) == 1) { + if (mp_iszero (b) == MP_YES) { return mp_abs (a, c); } - /* optimized. At this point if a == 0 then - * b must equal zero too - */ - if (mp_iszero (a) == 1) { - mp_zero(c); - return MP_OKAY; - } - /* get copies of a and b we can modify */ if ((res = mp_init_copy (&u, a)) != MP_OKAY) { return res; @@ -3270,8 +3256,8 @@ LBL_U:mp_clear (&v); #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_gcd.c */ @@ -3290,7 +3276,7 @@ LBL_U:mp_clear (&v); * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* get the lower 32-bits of an mp_int */ @@ -3319,8 +3305,8 @@ unsigned long mp_get_int(mp_int * a) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_get_int.c */ @@ -3339,7 +3325,7 @@ unsigned long mp_get_int(mp_int * a) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* grow as required */ @@ -3380,8 +3366,8 @@ int mp_grow (mp_int * a, int size) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_grow.c */ @@ -3400,7 +3386,7 @@ int mp_grow (mp_int * a, int size) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* init a new mp_int */ @@ -3430,8 +3416,8 @@ int mp_init (mp_int * a) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_init.c */ @@ -3450,7 +3436,7 @@ int mp_init (mp_int * a) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* creates "a" then copies b into it */ @@ -3466,8 +3452,8 @@ int mp_init_copy (mp_int * a, mp_int * b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_init_copy.c */ @@ -3486,7 +3472,7 @@ int mp_init_copy (mp_int * a, mp_int * b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ #include <stdarg.h> @@ -3529,8 +3515,8 @@ int mp_init_multi(mp_int *mp, ...) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_init_multi.c */ @@ -3549,7 +3535,7 @@ int mp_init_multi(mp_int *mp, ...) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* initialize and set a digit */ @@ -3565,8 +3551,8 @@ int mp_init_set (mp_int * a, mp_digit b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_init_set.c */ @@ -3585,7 +3571,7 @@ int mp_init_set (mp_int * a, mp_digit b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* initialize and set a digit */ @@ -3600,8 +3586,8 @@ int mp_init_set_int (mp_int * a, unsigned long b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_init_set_int.c */ @@ -3620,7 +3606,7 @@ int mp_init_set_int (mp_int * a, unsigned long b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* init an mp_init for a given size */ @@ -3652,8 +3638,8 @@ int mp_init_size (mp_int * a, int size) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_init_size.c */ @@ -3672,7 +3658,7 @@ int mp_init_size (mp_int * a, int size) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* hac 14.61, pp608 */ @@ -3699,8 +3685,8 @@ int mp_invmod (mp_int * a, mp_int * b, mp_int * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_invmod.c */ @@ -3719,7 +3705,7 @@ int mp_invmod (mp_int * a, mp_int * b, mp_int * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* hac 14.61, pp608 */ @@ -3878,8 +3864,8 @@ LBL_ERR:mp_clear_multi (&x, &y, &u, &v, &A, &B, &C, &D, NULL); #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_invmod_slow.c */ @@ -3898,7 +3884,7 @@ LBL_ERR:mp_clear_multi (&x, &y, &u, &v, &A, &B, &C, &D, NULL); * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* Check if remainders are possible squares - fast exclude non-squares */ @@ -3991,8 +3977,8 @@ ERR:mp_clear(&t); #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_is_square.c */ @@ -4011,7 +3997,7 @@ ERR:mp_clear(&t); * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* computes the jacobi c = (a | n) (or Legendre if n is prime) @@ -4100,8 +4086,8 @@ LBL_A1:mp_clear (&a1); #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_jacobi.c */ @@ -4120,7 +4106,7 @@ LBL_A1:mp_clear (&a1); * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* c = |a| * |b| using Karatsuba Multiplication using @@ -4271,8 +4257,8 @@ ERR: #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_karatsuba_mul.c */ @@ -4291,7 +4277,7 @@ ERR: * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* Karatsuba squaring, computes b = a*a using three @@ -4396,8 +4382,8 @@ ERR: #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_karatsuba_sqr.c */ @@ -4416,7 +4402,7 @@ ERR: * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* computes least common multiple as |a*b|/(a, b) */ @@ -4460,8 +4446,8 @@ LBL_T: #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_lcm.c */ @@ -4480,7 +4466,7 @@ LBL_T: * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* shift left a certain amount of digits */ @@ -4531,8 +4517,8 @@ int mp_lshd (mp_int * a, int b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_lshd.c */ @@ -4551,7 +4537,7 @@ int mp_lshd (mp_int * a, int b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* c = a mod b, 0 <= c < b */ @@ -4583,8 +4569,8 @@ mp_mod (mp_int * a, mp_int * b, mp_int * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_mod.c */ @@ -4603,7 +4589,7 @@ mp_mod (mp_int * a, mp_int * b, mp_int * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* calc a value mod 2**b */ @@ -4642,8 +4628,8 @@ mp_mod_2d (mp_int * a, int b, mp_int * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_mod_2d.c */ @@ -4662,7 +4648,7 @@ mp_mod_2d (mp_int * a, int b, mp_int * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ int @@ -4673,8 +4659,8 @@ mp_mod_d (mp_int * a, mp_digit b, mp_digit * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_mod_d.c */ @@ -4693,7 +4679,7 @@ mp_mod_d (mp_int * a, mp_digit b, mp_digit * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* @@ -4736,8 +4722,8 @@ int mp_montgomery_calc_normalization (mp_int * a, mp_int * b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_montgomery_calc_normalization.c */ @@ -4756,7 +4742,7 @@ int mp_montgomery_calc_normalization (mp_int * a, mp_int * b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* computes xR**-1 == x (mod N) via Montgomery Reduction */ @@ -4858,8 +4844,8 @@ mp_montgomery_reduce (mp_int * x, mp_int * n, mp_digit rho) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_montgomery_reduce.c */ @@ -4878,7 +4864,7 @@ mp_montgomery_reduce (mp_int * x, mp_int * n, mp_digit rho) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* setups the montgomery reduction stuff */ @@ -4921,8 +4907,8 @@ mp_montgomery_setup (mp_int * n, mp_digit * rho) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_montgomery_setup.c */ @@ -4941,7 +4927,7 @@ mp_montgomery_setup (mp_int * n, mp_digit * rho) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* high level multiplication (handles sign) */ @@ -4991,8 +4977,8 @@ int mp_mul (mp_int * a, mp_int * b, mp_int * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_mul.c */ @@ -5011,7 +4997,7 @@ int mp_mul (mp_int * a, mp_int * b, mp_int * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* b = a*2 */ @@ -5077,8 +5063,8 @@ int mp_mul_2(mp_int * a, mp_int * b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_mul_2.c */ @@ -5097,7 +5083,7 @@ int mp_mul_2(mp_int * a, mp_int * b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* shift left by a certain bit count */ @@ -5166,8 +5152,8 @@ int mp_mul_2d (mp_int * a, int b, mp_int * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_mul_2d.c */ @@ -5186,7 +5172,7 @@ int mp_mul_2d (mp_int * a, int b, mp_int * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* multiply by a digit */ @@ -5249,8 +5235,8 @@ mp_mul_d (mp_int * a, mp_digit b, mp_int * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_mul_d.c */ @@ -5269,7 +5255,7 @@ mp_mul_d (mp_int * a, mp_digit b, mp_int * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* d = a * b (mod c) */ @@ -5293,8 +5279,8 @@ int mp_mulmod (mp_int * a, mp_int * b, mp_int * c, mp_int * d) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_mulmod.c */ @@ -5313,7 +5299,7 @@ int mp_mulmod (mp_int * a, mp_int * b, mp_int * c, mp_int * d) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* find the n'th root of an integer @@ -5429,8 +5415,8 @@ LBL_T1:mp_clear (&t1); #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_n_root.c */ @@ -5449,7 +5435,7 @@ LBL_T1:mp_clear (&t1); * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* b = -a */ @@ -5473,8 +5459,8 @@ int mp_neg (mp_int * a, mp_int * b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_neg.c */ @@ -5493,7 +5479,7 @@ int mp_neg (mp_int * a, mp_int * b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* OR two ints together */ @@ -5527,8 +5513,8 @@ int mp_or (mp_int * a, mp_int * b, mp_int * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_or.c */ @@ -5547,7 +5533,7 @@ int mp_or (mp_int * a, mp_int * b, mp_int * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* performs one Fermat test. @@ -5593,8 +5579,8 @@ LBL_T:mp_clear (&t); #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_prime_fermat.c */ @@ -5613,7 +5599,7 @@ LBL_T:mp_clear (&t); * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* determines if an integers is divisible by one @@ -5647,8 +5633,8 @@ int mp_prime_is_divisible (mp_int * a, int *result) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_prime_is_divisible.c */ @@ -5667,7 +5653,7 @@ int mp_prime_is_divisible (mp_int * a, int *result) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* performs a variable number of rounds of Miller-Rabin @@ -5734,8 +5720,8 @@ LBL_B:mp_clear (&b); #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_prime_is_prime.c */ @@ -5754,7 +5740,7 @@ LBL_B:mp_clear (&b); * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* Miller-Rabin test of "a" to the base of "b" as described in @@ -5841,8 +5827,8 @@ LBL_N1:mp_clear (&n1); #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_prime_miller_rabin.c */ @@ -5861,7 +5847,7 @@ LBL_N1:mp_clear (&n1); * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* finds the next prime after the number "a" using "t" trials @@ -6015,8 +6001,8 @@ LBL_ERR: #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_prime_next_prime.c */ @@ -6035,7 +6021,7 @@ LBL_ERR: * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ @@ -6071,8 +6057,8 @@ int mp_prime_rabin_miller_trials(int size) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_prime_rabin_miller_trials.c */ @@ -6091,7 +6077,7 @@ int mp_prime_rabin_miller_trials(int size) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* makes a truly random prime of a given size (bits), @@ -6200,8 +6186,8 @@ error: #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_prime_random_ex.c */ @@ -6220,7 +6206,7 @@ error: * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* returns size of ASCII reprensentation */ @@ -6282,8 +6268,8 @@ int mp_radix_size (mp_int * a, int radix, int *size) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_radix_size.c */ @@ -6302,7 +6288,7 @@ int mp_radix_size (mp_int * a, int radix, int *size) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* chars used in radix conversions */ @@ -6310,8 +6296,8 @@ const char *mp_s_rmap = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrs #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_radix_smap.c */ @@ -6330,7 +6316,7 @@ const char *mp_s_rmap = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrs * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* makes a pseudo-random int of a given size */ @@ -6369,8 +6355,8 @@ mp_rand (mp_int * a, int digits) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_rand.c */ @@ -6389,7 +6375,7 @@ mp_rand (mp_int * a, int digits) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* read a string [ASCII] in a given radix */ @@ -6458,8 +6444,8 @@ int mp_read_radix (mp_int * a, const char *str, int radix) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_read_radix.c */ @@ -6478,7 +6464,7 @@ int mp_read_radix (mp_int * a, const char *str, int radix) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* read signed bin, big endian, first byte is 0==positive or 1==negative */ @@ -6503,8 +6489,8 @@ int mp_read_signed_bin (mp_int * a, const unsigned char *b, int c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_read_signed_bin.c */ @@ -6523,7 +6509,7 @@ int mp_read_signed_bin (mp_int * a, const unsigned char *b, int c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* reads a unsigned char array, assumes the msb is stored first [big endian] */ @@ -6562,8 +6548,8 @@ int mp_read_unsigned_bin (mp_int * a, const unsigned char *b, int c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_read_unsigned_bin.c */ @@ -6582,7 +6568,7 @@ int mp_read_unsigned_bin (mp_int * a, const unsigned char *b, int c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* reduces x mod m, assumes 0 < x < m**2, mu is @@ -6666,8 +6652,8 @@ CLEANUP: #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_reduce.c */ @@ -6686,7 +6672,7 @@ CLEANUP: * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* reduces a modulo n where n is of the form 2**p - d */ @@ -6731,8 +6717,8 @@ ERR: #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_reduce_2k.c */ @@ -6751,7 +6737,7 @@ ERR: * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* reduces a modulo n where n is of the form 2**p - d @@ -6797,8 +6783,8 @@ ERR: #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_reduce_2k_l.c */ @@ -6817,7 +6803,7 @@ ERR: * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* determines the setup value */ @@ -6848,8 +6834,8 @@ int mp_reduce_2k_setup(mp_int *a, mp_digit *d) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_reduce_2k_setup.c */ @@ -6868,7 +6854,7 @@ int mp_reduce_2k_setup(mp_int *a, mp_digit *d) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* determines the setup value */ @@ -6896,8 +6882,8 @@ ERR: #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_reduce_2k_setup_l.c */ @@ -6916,7 +6902,7 @@ ERR: * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* determines if mp_reduce_2k can be used */ @@ -6952,8 +6938,8 @@ int mp_reduce_is_2k(mp_int *a) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_reduce_is_2k.c */ @@ -6972,7 +6958,7 @@ int mp_reduce_is_2k(mp_int *a) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* determines if reduce_2k_l can be used */ @@ -7000,8 +6986,8 @@ int mp_reduce_is_2k_l(mp_int *a) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_reduce_is_2k_l.c */ @@ -7020,7 +7006,7 @@ int mp_reduce_is_2k_l(mp_int *a) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* pre-calculate the value required for Barrett reduction @@ -7038,8 +7024,8 @@ int mp_reduce_setup (mp_int * a, mp_int * b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_reduce_setup.c */ @@ -7058,7 +7044,7 @@ int mp_reduce_setup (mp_int * a, mp_int * b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* shift right a certain amount of digits */ @@ -7114,8 +7100,8 @@ void mp_rshd (mp_int * a, int b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_rshd.c */ @@ -7134,7 +7120,7 @@ void mp_rshd (mp_int * a, int b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* set to a digit */ @@ -7147,8 +7133,8 @@ void mp_set (mp_int * a, mp_digit b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_set.c */ @@ -7167,7 +7153,7 @@ void mp_set (mp_int * a, mp_digit b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* set a 32-bit const */ @@ -7199,8 +7185,8 @@ int mp_set_int (mp_int * a, unsigned long b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_set_int.c */ @@ -7219,7 +7205,7 @@ int mp_set_int (mp_int * a, unsigned long b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* shrink a bignum */ @@ -7238,8 +7224,8 @@ int mp_shrink (mp_int * a) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_shrink.c */ @@ -7258,7 +7244,7 @@ int mp_shrink (mp_int * a) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* get the size for an signed equivalent */ @@ -7269,8 +7255,8 @@ int mp_signed_bin_size (mp_int * a) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_signed_bin_size.c */ @@ -7289,7 +7275,7 @@ int mp_signed_bin_size (mp_int * a) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* computes b = a*a */ @@ -7331,8 +7317,8 @@ if (a->used >= KARATSUBA_SQR_CUTOFF) { #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_sqr.c */ @@ -7351,7 +7337,7 @@ if (a->used >= KARATSUBA_SQR_CUTOFF) { * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* c = a * a (mod b) */ @@ -7376,8 +7362,8 @@ mp_sqrmod (mp_int * a, mp_int * b, mp_int * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_sqrmod.c */ @@ -7396,7 +7382,7 @@ mp_sqrmod (mp_int * a, mp_int * b, mp_int * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* this function is less generic than mp_n_root, simpler and faster */ @@ -7461,8 +7447,8 @@ E2: mp_clear(&t1); #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_sqrt.c */ @@ -7481,7 +7467,7 @@ E2: mp_clear(&t1); * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* high level subtraction (handles signs) */ @@ -7524,8 +7510,8 @@ mp_sub (mp_int * a, mp_int * b, mp_int * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_sub.c */ @@ -7544,7 +7530,7 @@ mp_sub (mp_int * a, mp_int * b, mp_int * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* single digit subtraction */ @@ -7621,8 +7607,8 @@ mp_sub_d (mp_int * a, mp_digit b, mp_int * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_sub_d.c */ @@ -7641,7 +7627,7 @@ mp_sub_d (mp_int * a, mp_digit b, mp_int * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* d = a - b (mod c) */ @@ -7667,8 +7653,8 @@ mp_submod (mp_int * a, mp_int * b, mp_int * c, mp_int * d) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_submod.c */ @@ -7687,7 +7673,7 @@ mp_submod (mp_int * a, mp_int * b, mp_int * c, mp_int * d) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* store in signed [big endian] format */ @@ -7704,8 +7690,8 @@ int mp_to_signed_bin (mp_int * a, unsigned char *b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_to_signed_bin.c */ @@ -7724,7 +7710,7 @@ int mp_to_signed_bin (mp_int * a, unsigned char *b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* store in signed [big endian] format */ @@ -7739,8 +7725,8 @@ int mp_to_signed_bin_n (mp_int * a, unsigned char *b, unsigned long *outlen) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_to_signed_bin_n.c */ @@ -7759,7 +7745,7 @@ int mp_to_signed_bin_n (mp_int * a, unsigned char *b, unsigned long *outlen) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* store in unsigned [big endian] format */ @@ -7791,8 +7777,8 @@ int mp_to_unsigned_bin (mp_int * a, unsigned char *b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_to_unsigned_bin.c */ @@ -7811,7 +7797,7 @@ int mp_to_unsigned_bin (mp_int * a, unsigned char *b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* store in unsigned [big endian] format */ @@ -7826,8 +7812,8 @@ int mp_to_unsigned_bin_n (mp_int * a, unsigned char *b, unsigned long *outlen) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_to_unsigned_bin_n.c */ @@ -7846,7 +7832,7 @@ int mp_to_unsigned_bin_n (mp_int * a, unsigned char *b, unsigned long *outlen) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* multiplication using the Toom-Cook 3-way algorithm @@ -8114,8 +8100,8 @@ ERR: #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_toom_mul.c */ @@ -8134,7 +8120,7 @@ ERR: * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* squaring using Toom-Cook 3-way algorithm */ @@ -8344,8 +8330,8 @@ ERR: #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_toom_sqr.c */ @@ -8364,7 +8350,7 @@ ERR: * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* stores a bignum as a ASCII string in a given radix (2..64) */ @@ -8423,8 +8409,8 @@ int mp_toradix (mp_int * a, char *str, int radix) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_toradix.c */ @@ -8443,7 +8429,7 @@ int mp_toradix (mp_int * a, char *str, int radix) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* stores a bignum as a ASCII string in a given radix (2..64) @@ -8515,8 +8501,8 @@ int mp_toradix_n(mp_int * a, char *str, int radix, int maxlen) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_toradix_n.c */ @@ -8535,7 +8521,7 @@ int mp_toradix_n(mp_int * a, char *str, int radix, int maxlen) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* get the size for an unsigned equivalent */ @@ -8547,8 +8533,8 @@ int mp_unsigned_bin_size (mp_int * a) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_unsigned_bin_size.c */ @@ -8567,7 +8553,7 @@ int mp_unsigned_bin_size (mp_int * a) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* XOR two ints together */ @@ -8602,8 +8588,8 @@ mp_xor (mp_int * a, mp_int * b, mp_int * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_xor.c */ @@ -8622,7 +8608,7 @@ mp_xor (mp_int * a, mp_int * b, mp_int * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* set to zero */ @@ -8642,8 +8628,8 @@ void mp_zero (mp_int * a) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_mp_zero.c */ @@ -8662,7 +8648,7 @@ void mp_zero (mp_int * a) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ const mp_digit ltm_prime_tab[] = { 0x0002, 0x0003, 0x0005, 0x0007, 0x000B, 0x000D, 0x0011, 0x0013, @@ -8707,8 +8693,8 @@ const mp_digit ltm_prime_tab[] = { #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_prime_tab.c */ @@ -8727,7 +8713,7 @@ const mp_digit ltm_prime_tab[] = { * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* reverse an array, used for radix code */ @@ -8750,8 +8736,8 @@ bn_reverse (unsigned char *s, int len) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_reverse.c */ @@ -8770,7 +8756,7 @@ bn_reverse (unsigned char *s, int len) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* low level addition, based on HAC pp.594, Algorithm 14.7 */ @@ -8863,8 +8849,8 @@ s_mp_add (mp_int * a, mp_int * b, mp_int * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_s_mp_add.c */ @@ -8883,7 +8869,7 @@ s_mp_add (mp_int * a, mp_int * b, mp_int * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ #ifdef MP_LOW_MEM #define TAB_SIZE 32 @@ -9119,8 +9105,8 @@ LBL_M: #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_s_mp_exptmod.c */ @@ -9139,7 +9125,7 @@ LBL_M: * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* multiplies |a| * |b| and only computes upto digs digits of result @@ -9213,8 +9199,8 @@ int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_s_mp_mul_digs.c */ @@ -9233,7 +9219,7 @@ int s_mp_mul_digs (mp_int * a, mp_int * b, mp_int * c, int digs) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* multiplies |a| * |b| and does not compute the lower digs digits @@ -9298,8 +9284,8 @@ s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_s_mp_mul_high_digs.c */ @@ -9318,7 +9304,7 @@ s_mp_mul_high_digs (mp_int * a, mp_int * b, mp_int * c, int digs) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* low level squaring, b = a*a, HAC pp.596-597, Algorithm 14.16 */ @@ -9386,8 +9372,8 @@ int s_mp_sqr (mp_int * a, mp_int * b) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_s_mp_sqr.c */ @@ -9406,7 +9392,7 @@ int s_mp_sqr (mp_int * a, mp_int * b) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* low level subtraction (assumes |a| > |b|), HAC pp.595 Algorithm 14.9 */ @@ -9479,8 +9465,8 @@ s_mp_sub (mp_int * a, mp_int * b, mp_int * c) #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bn_s_mp_sub.c */ @@ -9499,7 +9485,7 @@ s_mp_sub (mp_int * a, mp_int * b, mp_int * c) * The library is free for all purposes without any express * guarantee it works. * - * Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org + * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com */ /* Known optimal configurations @@ -9519,8 +9505,8 @@ int KARATSUBA_MUL_CUTOFF = 80, /* Min. number of digits before Karatsub #endif /* $Source: /root/tcl/repos-to-convert/tcl/libtommath/pre_gen/mpi.c,v $ */ -/* $Revision: 1.1.1.4 $ */ -/* $Date: 2005/12/27 18:00:26 $ */ +/* $Revision: 1.1.1.5 $ */ +/* $Date: 2006/12/01 00:08:34 $ */ /* End: bncore.c */ |