tommath/bn_mp_mul.c

87 lines
2.1 KiB
C
Raw Normal View History

2004-10-29 18:07:18 -04:00
#include <tommath.h>
#ifdef BN_MP_MUL_C
2003-02-28 11:08:34 -05:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
2003-08-04 21:24:44 -04:00
* LibTomMath is a library that provides multiple-precision
2003-02-28 11:08:34 -05:00
* integer arithmetic as well as number theoretic functionality.
*
2003-08-04 21:24:44 -04:00
* The library was designed directly after the MPI library by
2003-02-28 11:08:34 -05:00
* Michael Fromberger but has been written from scratch with
* additional optimizations in place.
*
* The library is free for all purposes without any express
* guarantee it works.
*
2007-04-18 05:58:18 -04:00
* Tom St Denis, tomstdenis@gmail.com, http://libtom.org
2003-02-28 11:08:34 -05:00
*/
/* high level multiplication (handles sign) */
2003-12-24 13:59:22 -05:00
int mp_mul (mp_int * a, mp_int * b, mp_int * c)
2003-02-28 11:08:34 -05:00
{
2003-02-28 11:09:08 -05:00
int res, neg;
2003-02-28 11:08:34 -05:00
neg = (a->sign == b->sign) ? MP_ZPOS : MP_NEG;
2003-08-04 21:24:44 -04:00
int an, bn, tn;
mp_int * t;
an = a -> used;
bn = b -> used;
if (an > bn) {
tn = an; an = bn; bn = tn;
t = a; a = b; b = t;
}
/* now a->used <= b->used */
2003-08-04 21:24:44 -04:00
/* use Toom-Cook? */
2004-10-29 18:07:18 -04:00
#ifdef BN_MP_TOOM_MUL_C
if (a->used >= TOOM_MUL_CUTOFF) {
if (2 * an <= bn) goto balance;
2003-05-29 09:35:26 -04:00
res = mp_toom_mul(a, b, c);
2004-10-29 18:07:18 -04:00
} else
#endif
#ifdef BN_MP_KARATSUBA_MUL_C
2003-08-04 21:24:44 -04:00
/* use Karatsuba? */
if (a->used >= KARATSUBA_MUL_CUTOFF) {
if (2 * an <= bn) goto balance;
2003-02-28 11:08:34 -05:00
res = mp_karatsuba_mul (a, b, c);
2004-10-29 18:07:18 -04:00
} else
#endif
{
2003-05-17 08:33:54 -04:00
/* can we use the fast multiplier?
2003-02-28 11:09:08 -05:00
*
2003-05-29 09:35:26 -04:00
* The fast multiplier can be used if the output will
* have less than MP_WARRAY digits and the number of
* digits won't affect carry propagation
2003-02-28 11:09:08 -05:00
*/
int digs = a->used + b->used + 1;
2004-10-29 18:07:18 -04:00
#ifdef BN_FAST_S_MP_MUL_DIGS_C
2003-05-29 09:35:26 -04:00
if ((digs < MP_WARRAY) &&
a->used <= (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
2003-02-28 11:09:08 -05:00
res = fast_s_mp_mul_digs (a, b, c, digs);
2004-10-29 18:07:18 -04:00
} else
#endif
#ifdef BN_S_MP_MUL_DIGS_C
res = s_mp_mul (a, b, c); /* uses s_mp_mul_digs */
#else
res = MP_VAL;
#endif
2003-02-28 11:08:34 -05:00
}
ret:
2004-08-09 18:15:59 -04:00
c->sign = (c->used > 0) ? neg : MP_ZPOS;
2003-02-28 11:08:34 -05:00
return res;
balance:
/* if a is much smaller than b
* use balance multiplication
* (the idea is taken from Ruby core)
*/
res = mp_balance_mul(a, b, c);
goto ret;
2003-02-28 11:08:34 -05:00
}
2004-10-29 18:07:18 -04:00
#endif
2005-08-01 12:37:28 -04:00
/* $Source$ */
/* $Revision$ */
/* $Date$ */