dropbear: libtommath/pre_gen/mpi.c comparison

comparison libtommath/pre_gen/mpi.c @ 415:8b9aba1d5fa4 channel-fix

merge of '73fe066c5d9e2395354ba74756124d45c978a04d' and 'f5014cc84558f1e8eba42dbecf9f72f94bfe6134'

author	Matt Johnston <matt@ucc.asn.au>
date	Tue, 06 Feb 2007 16:00:18 +0000
parents	5ff8218bcee9
children	60fc6476e044

comparison

equal deleted inserted replaced

-:c53a26c430e5
+:8b9aba1d5fa4
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 static const struct {
 int code;
 char *msg;
 return "Invalid error code";
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_error.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_error.c */
 /* Start: bn_fast_mp_invmod.c */
 #include <tommath.h>
 #ifdef BN_FAST_MP_INVMOD_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* computes the modular inverse via binary extended euclidean algorithm,
 * that is c = 1/a mod b
 *
 LBL_ERR:mp_clear_multi (&x, &y, &u, &v, &B, &D, NULL);
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_fast_mp_invmod.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_fast_mp_invmod.c */
 /* Start: bn_fast_mp_montgomery_reduce.c */
 #include <tommath.h>
 #ifdef BN_FAST_MP_MONTGOMERY_REDUCE_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* computes xR**-1 == x (mod N) via Montgomery Reduction
 *
 * This is an optimized implementation of montgomery_reduce
 }
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_fast_mp_montgomery_reduce.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_fast_mp_montgomery_reduce.c */
 /* Start: bn_fast_s_mp_mul_digs.c */
 #include <tommath.h>
 #ifdef BN_FAST_S_MP_MUL_DIGS_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* Fast (comba) multiplier
 *
 * This is the fast column-array [comba] multiplier.  It is
 iy = MIN(a->used-tx, ty+1);
 /* execute loop */
 for (iz = 0; iz < iy; ++iz) {
 _W += ((mp_word)*tmpx++)*((mp_word)*tmpy--);
 }
 /* store term */
 W[ix] = ((mp_digit)_W) & MP_MASK;
 /* make next carry */
 _W = _W >> ((mp_word)DIGIT_BIT);
 }
-/* store final carry */
-W[ix] = (mp_digit)(_W & MP_MASK);
 /* setup dest */
 olduse  = c->used;
 c->used = pa;
 mp_clamp (c);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_fast_s_mp_mul_digs.c,v $ */
+/* $Revision: 1.7 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_fast_s_mp_mul_digs.c */
 /* Start: bn_fast_s_mp_mul_high_digs.c */
 #include <tommath.h>
 #ifdef BN_FAST_S_MP_MUL_HIGH_DIGS_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* this is a modified version of fast_s_mul_digs that only produces
 * output digits *above* digs.  See the comments for fast_s_mul_digs
 * to see how it works.
 /* make next carry */
 _W = _W >> ((mp_word)DIGIT_BIT);
 }
-/* store final carry */
-W[ix] = (mp_digit)(_W & MP_MASK);
 /* setup dest */
 olduse  = c->used;
 c->used = pa;
 {
 register mp_digit *tmpc;
 tmpc = c->dp + digs;
-for (ix = digs; ix <= pa; ix++) {
+for (ix = digs; ix < pa; ix++) {
 /* now extract the previous digit [below the carry] */
 *tmpc++ = W[ix];
 }
 /* clear unused digits [that existed in the old copy of c] */
 mp_clamp (c);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_fast_s_mp_mul_high_digs.c,v $ */
+/* $Revision: 1.5 $ */
+/* $Date: 2006/11/14 03:46:25 $ */
 /* End: bn_fast_s_mp_mul_high_digs.c */
 /* Start: bn_fast_s_mp_sqr.c */
 #include <tommath.h>
 #ifdef BN_FAST_S_MP_SQR_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* the jist of squaring...
 * you do like mult except the offset of the tmpx [one that
 * starts closer to zero] can't equal the offset of tmpy.
 mp_clamp (b);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_fast_s_mp_sqr.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_fast_s_mp_sqr.c */
 /* Start: bn_mp_2expt.c */
 #include <tommath.h>
 #ifdef BN_MP_2EXPT_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* computes a = 2**b
 *
 * Simple algorithm which zeroes the int, grows it then just sets one bit
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_2expt.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_2expt.c */
 /* Start: bn_mp_abs.c */
 #include <tommath.h>
 #ifdef BN_MP_ABS_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* b = |a|
 *
 * Simple function copies the input and fixes the sign to positive
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_abs.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_abs.c */
 /* Start: bn_mp_add.c */
 #include <tommath.h>
 #ifdef BN_MP_ADD_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* high level addition (handles signs) */
 int mp_add (mp_int * a, mp_int * b, mp_int * c)
 {
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_add.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_add.c */
 /* Start: bn_mp_add_d.c */
 #include <tommath.h>
 #ifdef BN_MP_ADD_D_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* single digit addition */
 int
 mp_add_d (mp_int * a, mp_digit b, mp_int * c)
 /* c = |a| - b */
 res = mp_sub_d(a, b, c);
 /* fix sign  */
 a->sign = c->sign = MP_NEG;
+/* clamp */
+mp_clamp(c);
 return res;
 }
 /* old number of used digits in c */
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_add_d.c,v $ */
+/* $Revision: 1.4 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_add_d.c */
 /* Start: bn_mp_addmod.c */
 #include <tommath.h>
 #ifdef BN_MP_ADDMOD_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* d = a + b (mod c) */
 int
 mp_addmod (mp_int * a, mp_int * b, mp_int * c, mp_int * d)
 mp_clear (&t);
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_addmod.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_addmod.c */
 /* Start: bn_mp_and.c */
 #include <tommath.h>
 #ifdef BN_MP_AND_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* AND two ints together */
 int
 mp_and (mp_int * a, mp_int * b, mp_int * c)
 mp_clear (&t);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_and.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_and.c */
 /* Start: bn_mp_clamp.c */
 #include <tommath.h>
 #ifdef BN_MP_CLAMP_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* trim unused digits
 *
 * This is used to ensure that leading zero digits are
 a->sign = MP_ZPOS;
 }
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_clamp.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_clamp.c */
 /* Start: bn_mp_clear.c */
 #include <tommath.h>
 #ifdef BN_MP_CLEAR_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* clear one (frees)  */
 void
 mp_clear (mp_int * a)
 a->sign  = MP_ZPOS;
 }
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_clear.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_clear.c */
 /* Start: bn_mp_clear_multi.c */
 #include <tommath.h>
 #ifdef BN_MP_CLEAR_MULTI_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 #include <stdarg.h>
 void mp_clear_multi(mp_int *mp, ...)
 {
 }
 va_end(args);
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_clear_multi.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_clear_multi.c */
 /* Start: bn_mp_cmp.c */
 #include <tommath.h>
 #ifdef BN_MP_CMP_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* compare two ints (signed)*/
 int
 mp_cmp (mp_int * a, mp_int * b)
 return mp_cmp_mag(a, b);
 }
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_cmp.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_cmp.c */
 /* Start: bn_mp_cmp_d.c */
 #include <tommath.h>
 #ifdef BN_MP_CMP_D_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* compare a digit */
 int mp_cmp_d(mp_int * a, mp_digit b)
 {
 return MP_EQ;
 }
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_cmp_d.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_cmp_d.c */
 /* Start: bn_mp_cmp_mag.c */
 #include <tommath.h>
 #ifdef BN_MP_CMP_MAG_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* compare maginitude of two ints (unsigned) */
 int mp_cmp_mag (mp_int * a, mp_int * b)
 {
 }
 return MP_EQ;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_cmp_mag.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_cmp_mag.c */
 /* Start: bn_mp_cnt_lsb.c */
 #include <tommath.h>
 #ifdef BN_MP_CNT_LSB_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 static const int lnz[16] = {
 4, 0, 1, 0, 2, 0, 1, 0, 3, 0, 1, 0, 2, 0, 1, 0
 };
 return x;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_cnt_lsb.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_cnt_lsb.c */
 /* Start: bn_mp_copy.c */
 #include <tommath.h>
 #ifdef BN_MP_COPY_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* copy, b = a */
 int
 mp_copy (mp_int * a, mp_int * b)
 b->sign = a->sign;
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_copy.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_copy.c */
 /* Start: bn_mp_count_bits.c */
 #include <tommath.h>
 #ifdef BN_MP_COUNT_BITS_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* returns the number of bits in an int */
 int
 mp_count_bits (mp_int * a)
 }
 return r;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_count_bits.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_count_bits.c */
 /* Start: bn_mp_div.c */
 #include <tommath.h>
 #ifdef BN_MP_DIV_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 #ifdef BN_MP_DIV_SMALL
 /* slower bit-bang division... also smaller */
 #endif
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_div.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_div.c */
 /* Start: bn_mp_div_2.c */
 #include <tommath.h>
 #ifdef BN_MP_DIV_2_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* b = a/2 */
 int mp_div_2(mp_int * a, mp_int * b)
 {
 mp_clamp (b);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_div_2.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_div_2.c */
 /* Start: bn_mp_div_2d.c */
 #include <tommath.h>
 #ifdef BN_MP_DIV_2D_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* shift right by a certain bit count (store quotient in c, optional remainder in d) */
 int mp_div_2d (mp_int * a, int b, mp_int * c, mp_int * d)
 {
 mp_clear (&t);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_div_2d.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_div_2d.c */
 /* Start: bn_mp_div_3.c */
 #include <tommath.h>
 #ifdef BN_MP_DIV_3_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* divide by three (based on routine from MPI and the GMP manual) */
 int
 mp_div_3 (mp_int * a, mp_int *c, mp_digit * d)
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_div_3.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_div_3.c */
 /* Start: bn_mp_div_d.c */
 #include <tommath.h>
 #ifdef BN_MP_DIV_D_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 static int s_is_power_of_two(mp_digit b, int *p)
 {
 int x;
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_div_d.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_div_d.c */
 /* Start: bn_mp_dr_is_modulus.c */
 #include <tommath.h>
 #ifdef BN_MP_DR_IS_MODULUS_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* determines if a number is a valid DR modulus */
 int mp_dr_is_modulus(mp_int *a)
 {
 return 1;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_dr_is_modulus.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_dr_is_modulus.c */
 /* Start: bn_mp_dr_reduce.c */
 #include <tommath.h>
 #ifdef BN_MP_DR_REDUCE_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* reduce "x" in place modulo "n" using the Diminished Radix algorithm.
 *
 * Based on algorithm from the paper
 }
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_dr_reduce.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_dr_reduce.c */
 /* Start: bn_mp_dr_setup.c */
 #include <tommath.h>
 #ifdef BN_MP_DR_SETUP_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* determines the setup value */
 void mp_dr_setup(mp_int *a, mp_digit *d)
 {
 ((mp_word)a->dp[0]));
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_dr_setup.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_dr_setup.c */
 /* Start: bn_mp_exch.c */
 #include <tommath.h>
 #ifdef BN_MP_EXCH_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* swap the elements of two integers, for cases where you can't simply swap the
 * mp_int pointers around
 */
 *a = *b;
 *b = t;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_exch.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_exch.c */
 /* Start: bn_mp_expt_d.c */
 #include <tommath.h>
 #ifdef BN_MP_EXPT_D_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* calculate c = a**b  using a square-multiply algorithm */
 int mp_expt_d (mp_int * a, mp_digit b, mp_int * c)
 {
 mp_clear (&g);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_expt_d.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_expt_d.c */
 /* Start: bn_mp_exptmod.c */
 #include <tommath.h>
 #ifdef BN_MP_EXPTMOD_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* this is a shell function that calls either the normal or Montgomery
 * exptmod functions.  Originally the call to the montgomery code was
 return MP_VAL;
 #endif
 }
 /* modified diminished radix reduction */
-#if defined(BN_MP_REDUCE_IS_2K_L_C) && defined(BN_MP_REDUCE_2K_L_C)
+#if defined(BN_MP_REDUCE_IS_2K_L_C) && defined(BN_MP_REDUCE_2K_L_C) && defined(BN_S_MP_EXPTMOD_C)
 if (mp_reduce_is_2k_l(P) == MP_YES) {
 return s_mp_exptmod(G, X, P, Y, 1);
 }
 #endif
 #endif
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_exptmod.c,v $ */
+/* $Revision: 1.4 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_exptmod.c */
 /* Start: bn_mp_exptmod_fast.c */
 #include <tommath.h>
 #ifdef BN_MP_EXPTMOD_FAST_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* computes Y == G**X mod P, HAC pp.616, Algorithm 14.85
 *
 * Uses a left-to-right k-ary sliding window to compute the modular exponentiation.
 return err;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_exptmod_fast.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_exptmod_fast.c */
 /* Start: bn_mp_exteuclid.c */
 #include <tommath.h>
 #ifdef BN_MP_EXTEUCLID_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* Extended euclidean algorithm of (a, b) produces
 a*u1 + b*u2 = u3
 */
 _ERR: mp_clear_multi(&u1, &u2, &u3, &v1, &v2, &v3, &t1, &t2, &t3, &q, &tmp, NULL);
 return err;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_exteuclid.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_exteuclid.c */
 /* Start: bn_mp_fread.c */
 #include <tommath.h>
 #ifdef BN_MP_FREAD_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* read a bigint from a file stream in ASCII */
 int mp_fread(mp_int *a, int radix, FILE *stream)
 {
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_fread.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_fread.c */
 /* Start: bn_mp_fwrite.c */
 #include <tommath.h>
 #ifdef BN_MP_FWRITE_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 int mp_fwrite(mp_int *a, int radix, FILE *stream)
 {
 char *buf;
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_fwrite.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_fwrite.c */
 /* Start: bn_mp_gcd.c */
 #include <tommath.h>
 #ifdef BN_MP_GCD_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* Greatest Common Divisor using the binary method */
 int mp_gcd (mp_int * a, mp_int * b, mp_int * c)
 {
 mp_int  u, v;
 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;
 LBL_U:mp_clear (&v);
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_gcd.c,v $ */
+/* $Revision: 1.4 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_gcd.c */
 /* Start: bn_mp_get_int.c */
 #include <tommath.h>
 #ifdef BN_MP_GET_INT_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* get the lower 32-bits of an mp_int */
 unsigned long mp_get_int(mp_int * a)
 {
 /* force result to 32-bits always so it is consistent on non 32-bit platforms */
 return res & 0xFFFFFFFFUL;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_get_int.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_get_int.c */
 /* Start: bn_mp_grow.c */
 #include <tommath.h>
 #ifdef BN_MP_GROW_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* grow as required */
 int mp_grow (mp_int * a, int size)
 {
 }
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_grow.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_grow.c */
 /* Start: bn_mp_init.c */
 #include <tommath.h>
 #ifdef BN_MP_INIT_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* init a new mp_int */
 int mp_init (mp_int * a)
 {
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_init.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_init.c */
 /* Start: bn_mp_init_copy.c */
 #include <tommath.h>
 #ifdef BN_MP_INIT_COPY_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* creates "a" then copies b into it */
 int mp_init_copy (mp_int * a, mp_int * b)
 {
 }
 return mp_copy (b, a);
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_init_copy.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_init_copy.c */
 /* Start: bn_mp_init_multi.c */
 #include <tommath.h>
 #ifdef BN_MP_INIT_MULTI_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 #include <stdarg.h>
 int mp_init_multi(mp_int *mp, ...)
 {
 return res;                /* Assumed ok, if error flagged above. */
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_init_multi.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_init_multi.c */
 /* Start: bn_mp_init_set.c */
 #include <tommath.h>
 #ifdef BN_MP_INIT_SET_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* initialize and set a digit */
 int mp_init_set (mp_int * a, mp_digit b)
 {
 mp_set(a, b);
 return err;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_init_set.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_init_set.c */
 /* Start: bn_mp_init_set_int.c */
 #include <tommath.h>
 #ifdef BN_MP_INIT_SET_INT_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* initialize and set a digit */
 int mp_init_set_int (mp_int * a, unsigned long b)
 {
 }
 return mp_set_int(a, b);
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_init_set_int.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_init_set_int.c */
 /* Start: bn_mp_init_size.c */
 #include <tommath.h>
 #ifdef BN_MP_INIT_SIZE_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* init an mp_init for a given size */
 int mp_init_size (mp_int * a, int size)
 {
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_init_size.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_init_size.c */
 /* Start: bn_mp_invmod.c */
 #include <tommath.h>
 #ifdef BN_MP_INVMOD_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* hac 14.61, pp608 */
 int mp_invmod (mp_int * a, mp_int * b, mp_int * c)
 {
 return MP_VAL;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_invmod.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_invmod.c */
 /* Start: bn_mp_invmod_slow.c */
 #include <tommath.h>
 #ifdef BN_MP_INVMOD_SLOW_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* hac 14.61, pp608 */
 int mp_invmod_slow (mp_int * a, mp_int * b, mp_int * c)
 {
 LBL_ERR:mp_clear_multi (&x, &y, &u, &v, &A, &B, &C, &D, NULL);
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_invmod_slow.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_invmod_slow.c */
 /* Start: bn_mp_is_square.c */
 #include <tommath.h>
 #ifdef BN_MP_IS_SQUARE_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* Check if remainders are possible squares - fast exclude non-squares */
 static const char rem_128[128] = {
 0, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1,
 ERR:mp_clear(&t);
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_is_square.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_is_square.c */
 /* Start: bn_mp_jacobi.c */
 #include <tommath.h>
 #ifdef BN_MP_JACOBI_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* computes the jacobi c = (a | n) (or Legendre if n is prime)
 * HAC pp. 73 Algorithm 2.149
 */
 LBL_A1:mp_clear (&a1);
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_jacobi.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_jacobi.c */
 /* Start: bn_mp_karatsuba_mul.c */
 #include <tommath.h>
 #ifdef BN_MP_KARATSUBA_MUL_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* c = |a| * |b| using Karatsuba Multiplication using
 * three half size multiplications
 *
 *
 * a = a1 * B**n + a0
 * b = b1 * B**n + b0
 *
 * Then, a * b =>
-a1b1 * B**2n + ((a1 - a0)(b1 - b0) + a0b0 + a1b1) * B + a0b0
+a1b1 * B**2n + ((a1 + a0)(b1 + b0) - (a0b0 + a1b1)) * B + a0b0
 *
 * Note that a1b1 and a0b0 are used twice and only need to be
 * computed once.  So in total three half size (half # of
 * digit) multiplications are performed, a0b0, a1b1 and
-* (a1-b1)(a0-b0)
+* (a1+b1)(a0+b0)
 *
 * Note that a multiplication of half the digits requires
 * 1/4th the number of single precision multiplications so in
 * total after one call 25% of the single precision multiplications
 * are saved.  Note also that the call to mp_mul can end up back
 if (mp_mul (&x0, &y0, &x0y0) != MP_OKAY)
 goto X1Y1;          /* x0y0 = x0*y0 */
 if (mp_mul (&x1, &y1, &x1y1) != MP_OKAY)
 goto X1Y1;          /* x1y1 = x1*y1 */
-/* now calc x1-x0 and y1-y0 */
+/* now calc x1+x0 and y1+y0 */
-if (mp_sub (&x1, &x0, &t1) != MP_OKAY)
+if (s_mp_add (&x1, &x0, &t1) != MP_OKAY)
 goto X1Y1;          /* t1 = x1 - x0 */
-if (mp_sub (&y1, &y0, &x0) != MP_OKAY)
+if (s_mp_add (&y1, &y0, &x0) != MP_OKAY)
 goto X1Y1;          /* t2 = y1 - y0 */
 if (mp_mul (&t1, &x0, &t1) != MP_OKAY)
-goto X1Y1;          /* t1 = (x1 - x0) * (y1 - y0) */
+goto X1Y1;          /* t1 = (x1 + x0) * (y1 + y0) */
 /* add x0y0 */
 if (mp_add (&x0y0, &x1y1, &x0) != MP_OKAY)
 goto X1Y1;          /* t2 = x0y0 + x1y1 */
-if (mp_sub (&x0, &t1, &t1) != MP_OKAY)
+if (s_mp_sub (&t1, &x0, &t1) != MP_OKAY)
-goto X1Y1;          /* t1 = x0y0 + x1y1 - (x1-x0)*(y1-y0) */
+goto X1Y1;          /* t1 = (x1+x0)*(y1+y0) - (x1y1 + x0y0) */
 /* shift by B */
 if (mp_lshd (&t1, B) != MP_OKAY)
 goto X1Y1;          /* t1 = (x0y0 + x1y1 - (x1-x0)*(y1-y0))<<B */
 if (mp_lshd (&x1y1, B * 2) != MP_OKAY)
 ERR:
 return err;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_karatsuba_mul.c,v $ */
+/* $Revision: 1.5 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_karatsuba_mul.c */
 /* Start: bn_mp_karatsuba_sqr.c */
 #include <tommath.h>
 #ifdef BN_MP_KARATSUBA_SQR_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* Karatsuba squaring, computes b = a*a using three
 * half size squarings
 *
 if (mp_sqr (&x0, &x0x0) != MP_OKAY)
 goto X1X1;           /* x0x0 = x0*x0 */
 if (mp_sqr (&x1, &x1x1) != MP_OKAY)
 goto X1X1;           /* x1x1 = x1*x1 */
-/* now calc (x1-x0)**2 */
+/* now calc (x1+x0)**2 */
-if (mp_sub (&x1, &x0, &t1) != MP_OKAY)
+if (s_mp_add (&x1, &x0, &t1) != MP_OKAY)
 goto X1X1;           /* t1 = x1 - x0 */
 if (mp_sqr (&t1, &t1) != MP_OKAY)
 goto X1X1;           /* t1 = (x1 - x0) * (x1 - x0) */
 /* add x0y0 */
 if (s_mp_add (&x0x0, &x1x1, &t2) != MP_OKAY)
 goto X1X1;           /* t2 = x0x0 + x1x1 */
-if (mp_sub (&t2, &t1, &t1) != MP_OKAY)
+if (s_mp_sub (&t1, &t2, &t1) != MP_OKAY)
-goto X1X1;           /* t1 = x0x0 + x1x1 - (x1-x0)*(x1-x0) */
+goto X1X1;           /* t1 = (x1+x0)**2 - (x0x0 + x1x1) */
 /* shift by B */
 if (mp_lshd (&t1, B) != MP_OKAY)
 goto X1X1;           /* t1 = (x0x0 + x1x1 - (x1-x0)*(x1-x0))<<B */
 if (mp_lshd (&x1x1, B * 2) != MP_OKAY)
 ERR:
 return err;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_karatsuba_sqr.c,v $ */
+/* $Revision: 1.5 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_karatsuba_sqr.c */
 /* Start: bn_mp_lcm.c */
 #include <tommath.h>
 #ifdef BN_MP_LCM_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* computes least common multiple as |a*b|/(a, b) */
 int mp_lcm (mp_int * a, mp_int * b, mp_int * c)
 {
 mp_clear_multi (&t1, &t2, NULL);
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_lcm.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_lcm.c */
 /* Start: bn_mp_lshd.c */
 #include <tommath.h>
 #ifdef BN_MP_LSHD_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* shift left a certain amount of digits */
 int mp_lshd (mp_int * a, int b)
 {
 }
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_lshd.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_lshd.c */
 /* Start: bn_mp_mod.c */
 #include <tommath.h>
 #ifdef BN_MP_MOD_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* c = a mod b, 0 <= c < b */
 int
 mp_mod (mp_int * a, mp_int * b, mp_int * c)
 mp_clear (&t);
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_mod.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_mod.c */
 /* Start: bn_mp_mod_2d.c */
 #include <tommath.h>
 #ifdef BN_MP_MOD_2D_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* calc a value mod 2**b */
 int
 mp_mod_2d (mp_int * a, int b, mp_int * c)
 mp_clamp (c);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_mod_2d.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_mod_2d.c */
 /* Start: bn_mp_mod_d.c */
 #include <tommath.h>
 #ifdef BN_MP_MOD_D_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 int
 mp_mod_d (mp_int * a, mp_digit b, mp_digit * c)
 {
 return mp_div_d(a, b, NULL, c);
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_mod_d.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_mod_d.c */
 /* Start: bn_mp_montgomery_calc_normalization.c */
 #include <tommath.h>
 #ifdef BN_MP_MONTGOMERY_CALC_NORMALIZATION_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /*
 * shifts with subtractions when the result is greater than b.
 *
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_montgomery_calc_normalization.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_montgomery_calc_normalization.c */
 /* Start: bn_mp_montgomery_reduce.c */
 #include <tommath.h>
 #ifdef BN_MP_MONTGOMERY_REDUCE_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* computes xR**-1 == x (mod N) via Montgomery Reduction */
 int
 mp_montgomery_reduce (mp_int * x, mp_int * n, mp_digit rho)
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_montgomery_reduce.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_montgomery_reduce.c */
 /* Start: bn_mp_montgomery_setup.c */
 #include <tommath.h>
 #ifdef BN_MP_MONTGOMERY_SETUP_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* setups the montgomery reduction stuff */
 int
 mp_montgomery_setup (mp_int * n, mp_digit * rho)
 #ifdef MP_64BIT
 x *= 2 - b * x;               /* here x*a==1 mod 2**64 */
 #endif
 /* rho = -1/m mod b */
-*rho = (((mp_word)1 << ((mp_word) DIGIT_BIT)) - x) & MP_MASK;
+*rho = (unsigned long)(((mp_word)1 << ((mp_word) DIGIT_BIT)) - x) & MP_MASK;
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_montgomery_setup.c,v $ */
+/* $Revision: 1.4 $ */
+/* $Date: 2006/12/04 21:34:03 $ */
 /* End: bn_mp_montgomery_setup.c */
 /* Start: bn_mp_mul.c */
 #include <tommath.h>
 #ifdef BN_MP_MUL_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* high level multiplication (handles sign) */
 int mp_mul (mp_int * a, mp_int * b, mp_int * c)
 {
 c->sign = (c->used > 0) ? neg : MP_ZPOS;
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_mul.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_mul.c */
 /* Start: bn_mp_mul_2.c */
 #include <tommath.h>
 #ifdef BN_MP_MUL_2_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* b = a*2 */
 int mp_mul_2(mp_int * a, mp_int * b)
 {
 b->sign = a->sign;
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_mul_2.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_mul_2.c */
 /* Start: bn_mp_mul_2d.c */
 #include <tommath.h>
 #ifdef BN_MP_MUL_2D_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* shift left by a certain bit count */
 int mp_mul_2d (mp_int * a, int b, mp_int * c)
 {
 mp_clamp (c);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_mul_2d.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_mul_2d.c */
 /* Start: bn_mp_mul_d.c */
 #include <tommath.h>
 #ifdef BN_MP_MUL_D_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* multiply by a digit */
 int
 mp_mul_d (mp_int * a, mp_digit b, mp_int * c)
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_mul_d.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_mul_d.c */
 /* Start: bn_mp_mulmod.c */
 #include <tommath.h>
 #ifdef BN_MP_MULMOD_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* d = a * b (mod c) */
-int
+int mp_mulmod (mp_int * a, mp_int * b, mp_int * c, mp_int * d)
-mp_mulmod (mp_int * a, mp_int * b, mp_int * c, mp_int * d)
 {
 int     res;
 mp_int  t;
 if ((res = mp_init (&t)) != MP_OKAY) {
 mp_clear (&t);
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_mulmod.c,v $ */
+/* $Revision: 1.4 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_mulmod.c */
 /* Start: bn_mp_n_root.c */
 #include <tommath.h>
 #ifdef BN_MP_N_ROOT_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* find the n'th root of an integer
 *
 * Result found such that (c)**b <= a and (c+1)**b > a
 LBL_T1:mp_clear (&t1);
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_n_root.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_n_root.c */
 /* Start: bn_mp_neg.c */
 #include <tommath.h>
 #ifdef BN_MP_NEG_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* b = -a */
 int mp_neg (mp_int * a, mp_int * b)
 {
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_neg.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_neg.c */
 /* Start: bn_mp_or.c */
 #include <tommath.h>
 #ifdef BN_MP_OR_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* OR two ints together */
 int mp_or (mp_int * a, mp_int * b, mp_int * c)
 {
 mp_clear (&t);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_or.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_or.c */
 /* Start: bn_mp_prime_fermat.c */
 #include <tommath.h>
 #ifdef BN_MP_PRIME_FERMAT_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* performs one Fermat test.
 *
 * If "a" were prime then b**a == b (mod a) since the order of
 LBL_T:mp_clear (&t);
 return err;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_prime_fermat.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_prime_fermat.c */
 /* Start: bn_mp_prime_is_divisible.c */
 #include <tommath.h>
 #ifdef BN_MP_PRIME_IS_DIVISIBLE_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* determines if an integers is divisible by one
 * of the first PRIME_SIZE primes or not
 *
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_prime_is_divisible.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_prime_is_divisible.c */
 /* Start: bn_mp_prime_is_prime.c */
 #include <tommath.h>
 #ifdef BN_MP_PRIME_IS_PRIME_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* performs a variable number of rounds of Miller-Rabin
 *
 * Probability of error after t rounds is no more than
 LBL_B:mp_clear (&b);
 return err;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_prime_is_prime.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_prime_is_prime.c */
 /* Start: bn_mp_prime_miller_rabin.c */
 #include <tommath.h>
 #ifdef BN_MP_PRIME_MILLER_RABIN_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* Miller-Rabin test of "a" to the base of "b" as described in
 * HAC pp. 139 Algorithm 4.24
 *
 LBL_N1:mp_clear (&n1);
 return err;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_prime_miller_rabin.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_prime_miller_rabin.c */
 /* Start: bn_mp_prime_next_prime.c */
 #include <tommath.h>
 #ifdef BN_MP_PRIME_NEXT_PRIME_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* finds the next prime after the number "a" using "t" trials
 * of Miller-Rabin.
 *
 return err;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_prime_next_prime.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_prime_next_prime.c */
 /* Start: bn_mp_prime_rabin_miller_trials.c */
 #include <tommath.h>
 #ifdef BN_MP_PRIME_RABIN_MILLER_TRIALS_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 static const struct {
 int k, t;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_prime_rabin_miller_trials.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_prime_rabin_miller_trials.c */
 /* Start: bn_mp_prime_random_ex.c */
 #include <tommath.h>
 #ifdef BN_MP_PRIME_RANDOM_EX_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* makes a truly random prime of a given size (bits),
 *
 * Flags are as follows:
 /* calc the maskOR_msb */
 maskOR_msb        = 0;
 maskOR_msb_offset = ((size & 7) == 1) ? 1 : 0;
 if (flags & LTM_PRIME_2MSB_ON) {
-maskOR_msb     |= 1 << ((size - 2) & 7);
+maskOR_msb       |= 0x80 >> ((9 - size) & 7);
-} else if (flags & LTM_PRIME_2MSB_OFF) {
+}
-maskAND        &= ~(1 << ((size - 2) & 7));
-}
 /* get the maskOR_lsb */
 maskOR_lsb         = 1;
 if (flags & LTM_PRIME_BBS) {
 maskOR_lsb     |= 3;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_prime_random_ex.c,v $ */
+/* $Revision: 1.4 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_prime_random_ex.c */
 /* Start: bn_mp_radix_size.c */
 #include <tommath.h>
 #ifdef BN_MP_RADIX_SIZE_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* returns size of ASCII reprensentation */
 int mp_radix_size (mp_int * a, int radix, int *size)
 {
 if (radix < 2 || radix > 64) {
 return MP_VAL;
 }
 if (mp_iszero(a) == MP_YES) {
 *size = 2;
 return MP_OKAY;
 }
 /* digs is the digit count */
 digs = 0;
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_radix_size.c,v $ */
+/* $Revision: 1.4 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_radix_size.c */
 /* Start: bn_mp_radix_smap.c */
 #include <tommath.h>
 #ifdef BN_MP_RADIX_SMAP_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* chars used in radix conversions */
 const char *mp_s_rmap = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz+/";
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_radix_smap.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_radix_smap.c */
 /* Start: bn_mp_rand.c */
 #include <tommath.h>
 #ifdef BN_MP_RAND_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* makes a pseudo-random int of a given size */
 int
 mp_rand (mp_int * a, int digits)
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_rand.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_rand.c */
 /* Start: bn_mp_read_radix.c */
 #include <tommath.h>
 #ifdef BN_MP_READ_RADIX_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* read a string [ASCII] in a given radix */
 int mp_read_radix (mp_int * a, const char *str, int radix)
 {
 int     y, res, neg;
 char    ch;
+/* zero the digit bignum */
+mp_zero(a);
 /* make sure the radix is ok */
 if (radix < 2 || radix > 64) {
 return MP_VAL;
 }
 }
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_read_radix.c,v $ */
+/* $Revision: 1.4 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_read_radix.c */
 /* Start: bn_mp_read_signed_bin.c */
 #include <tommath.h>
 #ifdef BN_MP_READ_SIGNED_BIN_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* read signed bin, big endian, first byte is 0==positive or 1==negative */
-int
+int mp_read_signed_bin (mp_int * a, const unsigned char *b, int c)
-mp_read_signed_bin (mp_int * a, unsigned char *b, int c)
 {
 int     res;
 /* read magnitude */
 if ((res = mp_read_unsigned_bin (a, b + 1, c - 1)) != MP_OKAY) {
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_read_signed_bin.c,v $ */
+/* $Revision: 1.4 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_read_signed_bin.c */
 /* Start: bn_mp_read_unsigned_bin.c */
 #include <tommath.h>
 #ifdef BN_MP_READ_UNSIGNED_BIN_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* reads a unsigned char array, assumes the msb is stored first [big endian] */
-int
+int mp_read_unsigned_bin (mp_int * a, const unsigned char *b, int c)
-mp_read_unsigned_bin (mp_int * a, unsigned char *b, int c)
 {
 int     res;
 /* make sure there are at least two digits */
 if (a->alloc < 2) {
 mp_clamp (a);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_read_unsigned_bin.c,v $ */
+/* $Revision: 1.4 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_read_unsigned_bin.c */
 /* Start: bn_mp_reduce.c */
 #include <tommath.h>
 #ifdef BN_MP_REDUCE_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* reduces x mod m, assumes 0 < x < m**2, mu is
 * precomputed via mp_reduce_setup.
 * From HAC pp.604 Algorithm 14.42
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_reduce.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_reduce.c */
 /* Start: bn_mp_reduce_2k.c */
 #include <tommath.h>
 #ifdef BN_MP_REDUCE_2K_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* reduces a modulo n where n is of the form 2**p - d */
 int mp_reduce_2k(mp_int *a, mp_int *n, mp_digit d)
 {
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_reduce_2k.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_reduce_2k.c */
 /* Start: bn_mp_reduce_2k_l.c */
 #include <tommath.h>
 #ifdef BN_MP_REDUCE_2K_L_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* reduces a modulo n where n is of the form 2**p - d
 This differs from reduce_2k since "d" can be larger
 than a single digit.
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_reduce_2k_l.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_reduce_2k_l.c */
 /* Start: bn_mp_reduce_2k_setup.c */
 #include <tommath.h>
 #ifdef BN_MP_REDUCE_2K_SETUP_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* determines the setup value */
 int mp_reduce_2k_setup(mp_int *a, mp_digit *d)
 {
 mp_clear(&tmp);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_reduce_2k_setup.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_reduce_2k_setup.c */
 /* Start: bn_mp_reduce_2k_setup_l.c */
 #include <tommath.h>
 #ifdef BN_MP_REDUCE_2K_SETUP_L_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* determines the setup value */
 int mp_reduce_2k_setup_l(mp_int *a, mp_int *d)
 {
 mp_clear(&tmp);
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_reduce_2k_setup_l.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_reduce_2k_setup_l.c */
 /* Start: bn_mp_reduce_is_2k.c */
 #include <tommath.h>
 #ifdef BN_MP_REDUCE_IS_2K_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* determines if mp_reduce_2k can be used */
 int mp_reduce_is_2k(mp_int *a)
 {
 return MP_YES;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_reduce_is_2k.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_reduce_is_2k.c */
 /* Start: bn_mp_reduce_is_2k_l.c */
 #include <tommath.h>
 #ifdef BN_MP_REDUCE_IS_2K_L_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* determines if reduce_2k_l can be used */
 int mp_reduce_is_2k_l(mp_int *a)
 {
 return MP_NO;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_reduce_is_2k_l.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_reduce_is_2k_l.c */
 /* Start: bn_mp_reduce_setup.c */
 #include <tommath.h>
 #ifdef BN_MP_REDUCE_SETUP_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* pre-calculate the value required for Barrett reduction
 * For a given modulus "b" it calulates the value required in "a"
 */
 }
 return mp_div (a, b, a, NULL);
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_reduce_setup.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_reduce_setup.c */
 /* Start: bn_mp_rshd.c */
 #include <tommath.h>
 #ifdef BN_MP_RSHD_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* shift right a certain amount of digits */
 void mp_rshd (mp_int * a, int b)
 {
 /* remove excess digits */
 a->used -= b;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_rshd.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_rshd.c */
 /* Start: bn_mp_set.c */
 #include <tommath.h>
 #ifdef BN_MP_SET_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* set to a digit */
 void mp_set (mp_int * a, mp_digit b)
 {
 a->dp[0] = b & MP_MASK;
 a->used  = (a->dp[0] != 0) ? 1 : 0;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_set.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_set.c */
 /* Start: bn_mp_set_int.c */
 #include <tommath.h>
 #ifdef BN_MP_SET_INT_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* set a 32-bit const */
 int mp_set_int (mp_int * a, unsigned long b)
 {
 mp_clamp (a);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_set_int.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_set_int.c */
 /* Start: bn_mp_shrink.c */
 #include <tommath.h>
 #ifdef BN_MP_SHRINK_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* shrink a bignum */
 int mp_shrink (mp_int * a)
 {
 }
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_shrink.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_shrink.c */
 /* Start: bn_mp_signed_bin_size.c */
 #include <tommath.h>
 #ifdef BN_MP_SIGNED_BIN_SIZE_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* get the size for an signed equivalent */
 int mp_signed_bin_size (mp_int * a)
 {
 return 1 + mp_unsigned_bin_size (a);
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_signed_bin_size.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_signed_bin_size.c */
 /* Start: bn_mp_sqr.c */
 #include <tommath.h>
 #ifdef BN_MP_SQR_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* computes b = a*a */
 int
 mp_sqr (mp_int * a, mp_int * b)
 b->sign = MP_ZPOS;
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_sqr.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_sqr.c */
 /* Start: bn_mp_sqrmod.c */
 #include <tommath.h>
 #ifdef BN_MP_SQRMOD_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* c = a * a (mod b) */
 int
 mp_sqrmod (mp_int * a, mp_int * b, mp_int * c)
 mp_clear (&t);
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_sqrmod.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_sqrmod.c */
 /* Start: bn_mp_sqrt.c */
 #include <tommath.h>
 #ifdef BN_MP_SQRT_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* this function is less generic than mp_n_root, simpler and faster */
 int mp_sqrt(mp_int *arg, mp_int *ret)
 {
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_sqrt.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_sqrt.c */
 /* Start: bn_mp_sub.c */
 #include <tommath.h>
 #ifdef BN_MP_SUB_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* high level subtraction (handles signs) */
 int
 mp_sub (mp_int * a, mp_int * b, mp_int * c)
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_sub.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_sub.c */
 /* Start: bn_mp_sub_d.c */
 #include <tommath.h>
 #ifdef BN_MP_SUB_D_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* single digit subtraction */
 int
 mp_sub_d (mp_int * a, mp_digit b, mp_int * c)
 */
 if (a->sign == MP_NEG) {
 a->sign = MP_ZPOS;
 res     = mp_add_d(a, b, c);
 a->sign = c->sign = MP_NEG;
+/* clamp */
+mp_clamp(c);
 return res;
 }
 /* setup regs */
 oldused = c->used;
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_sub_d.c,v $ */
+/* $Revision: 1.5 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_sub_d.c */
 /* Start: bn_mp_submod.c */
 #include <tommath.h>
 #ifdef BN_MP_SUBMOD_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* d = a - b (mod c) */
 int
 mp_submod (mp_int * a, mp_int * b, mp_int * c, mp_int * d)
 mp_clear (&t);
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_submod.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_submod.c */
 /* Start: bn_mp_to_signed_bin.c */
 #include <tommath.h>
 #ifdef BN_MP_TO_SIGNED_BIN_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* store in signed [big endian] format */
 int mp_to_signed_bin (mp_int * a, unsigned char *b)
 {
 b[0] = (unsigned char) ((a->sign == MP_ZPOS) ? 0 : 1);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_to_signed_bin.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_to_signed_bin.c */
 /* Start: bn_mp_to_signed_bin_n.c */
 #include <tommath.h>
 #ifdef BN_MP_TO_SIGNED_BIN_N_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* store in signed [big endian] format */
 int mp_to_signed_bin_n (mp_int * a, unsigned char *b, unsigned long *outlen)
 {
 *outlen = mp_signed_bin_size(a);
 return mp_to_signed_bin(a, b);
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_to_signed_bin_n.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_to_signed_bin_n.c */
 /* Start: bn_mp_to_unsigned_bin.c */
 #include <tommath.h>
 #ifdef BN_MP_TO_UNSIGNED_BIN_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* store in unsigned [big endian] format */
 int mp_to_unsigned_bin (mp_int * a, unsigned char *b)
 {
 mp_clear (&t);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_to_unsigned_bin.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_to_unsigned_bin.c */
 /* Start: bn_mp_to_unsigned_bin_n.c */
 #include <tommath.h>
 #ifdef BN_MP_TO_UNSIGNED_BIN_N_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* store in unsigned [big endian] format */
 int mp_to_unsigned_bin_n (mp_int * a, unsigned char *b, unsigned long *outlen)
 {
 *outlen = mp_unsigned_bin_size(a);
 return mp_to_unsigned_bin(a, b);
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_to_unsigned_bin_n.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_to_unsigned_bin_n.c */
 /* Start: bn_mp_toom_mul.c */
 #include <tommath.h>
 #ifdef BN_MP_TOOM_MUL_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* multiplication using the Toom-Cook 3-way algorithm
 *
 * Much more complicated than Karatsuba but has a lower
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_toom_mul.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_toom_mul.c */
 /* Start: bn_mp_toom_sqr.c */
 #include <tommath.h>
 #ifdef BN_MP_TOOM_SQR_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* squaring using Toom-Cook 3-way algorithm */
 int
 mp_toom_sqr(mp_int *a, mp_int *b)
 return res;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_toom_sqr.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_toom_sqr.c */
 /* Start: bn_mp_toradix.c */
 #include <tommath.h>
 #ifdef BN_MP_TORADIX_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* stores a bignum as a ASCII string in a given radix (2..64) */
 int mp_toradix (mp_int * a, char *str, int radix)
 {
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_toradix.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_toradix.c */
 /* Start: bn_mp_toradix_n.c */
 #include <tommath.h>
 #ifdef BN_MP_TORADIX_N_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* stores a bignum as a ASCII string in a given radix (2..64)
 *
 * Stores upto maxlen-1 chars and always a NULL byte
 mp_int  t;
 mp_digit d;
 char   *_s = str;
 /* check range of the maxlen, radix */
-if (maxlen < 3 || radix < 2 || radix > 64) {
+if (maxlen < 2 || radix < 2 || radix > 64) {
 return MP_VAL;
 }
 /* quick out if its zero */
-if (mp_iszero(a) == 1) {
+if (mp_iszero(a) == MP_YES) {
 *str++ = '0';
 *str = '\0';
 return MP_OKAY;
 }
 --maxlen;
 }
 digs = 0;
 while (mp_iszero (&t) == 0) {
+if (--maxlen < 1) {
+/* no more room */
+break;
+}
 if ((res = mp_div_d (&t, (mp_digit) radix, &t, &d)) != MP_OKAY) {
 mp_clear (&t);
 return res;
 }
 *str++ = mp_s_rmap[d];
 ++digs;
-if (--maxlen == 1) {
-/* no more room */
-break;
-}
 }
 /* reverse the digits of the string.  In this case _s points
-* to the first digit [exluding the sign] of the number]
+* to the first digit [exluding the sign] of the number
 */
 bn_reverse ((unsigned char *)_s, digs);
 /* append a NULL so the string is properly terminated */
 *str = '\0';
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_toradix_n.c,v $ */
+/* $Revision: 1.4 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_toradix_n.c */
 /* Start: bn_mp_unsigned_bin_size.c */
 #include <tommath.h>
 #ifdef BN_MP_UNSIGNED_BIN_SIZE_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* get the size for an unsigned equivalent */
 int mp_unsigned_bin_size (mp_int * a)
 {
 int     size = mp_count_bits (a);
 return (size / 8 + ((size & 7) != 0 ? 1 : 0));
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_unsigned_bin_size.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_unsigned_bin_size.c */
 /* Start: bn_mp_xor.c */
 #include <tommath.h>
 #ifdef BN_MP_XOR_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* XOR two ints together */
 int
 mp_xor (mp_int * a, mp_int * b, mp_int * c)
 mp_clear (&t);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_xor.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_xor.c */
 /* Start: bn_mp_zero.c */
 #include <tommath.h>
 #ifdef BN_MP_ZERO_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* set to zero */
 void mp_zero (mp_int * a)
 {
 *tmp++ = 0;
 }
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_mp_zero.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_mp_zero.c */
 /* Start: bn_prime_tab.c */
 #include <tommath.h>
 #ifdef BN_PRIME_TAB_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 const mp_digit ltm_prime_tab[] = {
 0x0002, 0x0003, 0x0005, 0x0007, 0x000B, 0x000D, 0x0011, 0x0013,
 0x0017, 0x001D, 0x001F, 0x0025, 0x0029, 0x002B, 0x002F, 0x0035,
 0x003B, 0x003D, 0x0043, 0x0047, 0x0049, 0x004F, 0x0053, 0x0059,
 0x062B, 0x062F, 0x063D, 0x0641, 0x0647, 0x0649, 0x064D, 0x0653
 #endif
 };
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_prime_tab.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_prime_tab.c */
 /* Start: bn_reverse.c */
 #include <tommath.h>
 #ifdef BN_REVERSE_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* reverse an array, used for radix code */
 void
 bn_reverse (unsigned char *s, int len)
 --iy;
 }
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_reverse.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_reverse.c */
 /* Start: bn_s_mp_add.c */
 #include <tommath.h>
 #ifdef BN_S_MP_ADD_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* low level addition, based on HAC pp.594, Algorithm 14.7 */
 int
 s_mp_add (mp_int * a, mp_int * b, mp_int * c)
 mp_clamp (c);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_s_mp_add.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_s_mp_add.c */
 /* Start: bn_s_mp_exptmod.c */
 #include <tommath.h>
 #ifdef BN_S_MP_EXPTMOD_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 #ifdef MP_LOW_MEM
 #define TAB_SIZE 32
 #else
 #define TAB_SIZE 256
 #endif
 }
 return err;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_s_mp_exptmod.c,v $ */
+/* $Revision: 1.4 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_s_mp_exptmod.c */
 /* Start: bn_s_mp_mul_digs.c */
 #include <tommath.h>
 #ifdef BN_S_MP_MUL_DIGS_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* multiplies |a| * |b| and only computes upto digs digits of result
 * HAC pp. 595, Algorithm 14.12  Modified so you can control how
 * many digits of output are created.
 mp_clear (&t);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_s_mp_mul_digs.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_s_mp_mul_digs.c */
 /* Start: bn_s_mp_mul_high_digs.c */
 #include <tommath.h>
 #ifdef BN_S_MP_MUL_HIGH_DIGS_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* multiplies |a| * |b| and does not compute the lower digs digits
 * [meant to get the higher part of the product]
 */
 mp_clear (&t);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_s_mp_mul_high_digs.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_s_mp_mul_high_digs.c */
 /* Start: bn_s_mp_sqr.c */
 #include <tommath.h>
 #ifdef BN_S_MP_SQR_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* low level squaring, b = a*a, HAC pp.596-597, Algorithm 14.16 */
 int s_mp_sqr (mp_int * a, mp_int * b)
 {
 mp_clear (&t);
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_s_mp_sqr.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_s_mp_sqr.c */
 /* Start: bn_s_mp_sub.c */
 #include <tommath.h>
 #ifdef BN_S_MP_SUB_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* low level subtraction (assumes |a| > |b|), HAC pp.595 Algorithm 14.9 */
 int
 s_mp_sub (mp_int * a, mp_int * b, mp_int * c)
 return MP_OKAY;
 }
 #endif
+/* $Source: /cvs/libtom/libtommath/bn_s_mp_sub.c,v $ */
+/* $Revision: 1.3 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bn_s_mp_sub.c */
 /* Start: bncore.c */
 #include <tommath.h>
 #ifdef BNCORE_C
 * additional optimizations in place.
 *
 * The library is free for all purposes without any express
 * guarantee it works.
 *
-* Tom St Denis, [email protected], http://math.libtomcrypt.org
+* Tom St Denis, [email protected], http://math.libtomcrypt.com
 */
 /* Known optimal configurations
 CPU                    /Compiler     /MUL CUTOFF/SQR CUTOFF
 -------------------------------------------------------------
 Intel P4 Northwood     /GCC v3.4.1   /        88/       128/LTM 0.32 ;-)
-AMD Athlon64           /GCC v3.4.4   /        74/       124/LTM 0.34
+AMD Athlon64           /GCC v3.4.4   /        80/       120/LTM 0.35
 */
-int     KARATSUBA_MUL_CUTOFF = 74,      /* Min. number of digits before Karatsuba multiplication is used. */
+int     KARATSUBA_MUL_CUTOFF = 80,      /* Min. number of digits before Karatsuba multiplication is used. */
-KARATSUBA_SQR_CUTOFF = 124,     /* Min. number of digits before Karatsuba squaring is used. */
+KARATSUBA_SQR_CUTOFF = 120,     /* Min. number of digits before Karatsuba squaring is used. */
 TOOM_MUL_CUTOFF      = 350,      /* no optimal values of these are known yet so set em high */
 TOOM_SQR_CUTOFF      = 400;
 #endif
+/* $Source: /cvs/libtom/libtommath/bncore.c,v $ */
+/* $Revision: 1.4 $ */
+/* $Date: 2006/03/31 14:18:44 $ */
 /* End: bncore.c */
 /* EOF */

Mercurial > dropbear

comparison libtommath/pre_gen/mpi.c @ 415:8b9aba1d5fa4 channel-fix