tommath/bn_mp_sqr.c

59 lines
1.3 KiB
C
Raw Normal View History

2004-10-29 18:07:18 -04:00
#include <tommath.h>
#ifdef BN_MP_SQR_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.
*
2003-03-12 21:11:11 -05:00
* Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org
2003-02-28 11:08:34 -05:00
*/
/* computes b = a*a */
int
mp_sqr (mp_int * a, mp_int * b)
{
2003-02-28 11:09:08 -05:00
int res;
2004-01-25 12:40:21 -05:00
2004-10-29 18:07:18 -04:00
#ifdef BN_MP_TOOM_SQR_C
2003-08-04 21:24:44 -04:00
/* use Toom-Cook? */
2003-05-29 09:35:26 -04:00
if (a->used >= TOOM_SQR_CUTOFF) {
res = mp_toom_sqr(a, b);
2003-08-04 21:24:44 -04:00
/* Karatsuba? */
2004-10-29 18:07:18 -04:00
} else
#endif
#ifdef BN_MP_KARATSUBA_SQR_C
if (a->used >= KARATSUBA_SQR_CUTOFF) {
2003-02-28 11:08:34 -05:00
res = mp_karatsuba_sqr (a, b);
2004-10-29 18:07:18 -04:00
} else
#endif
{
#ifdef BN_FAST_S_MP_SQR_C
2003-08-04 21:24:44 -04:00
/* can we use the fast comba multiplier? */
2003-05-29 09:35:26 -04:00
if ((a->used * 2 + 1) < MP_WARRAY &&
a->used <
(1 << (sizeof(mp_word) * CHAR_BIT - 2*DIGIT_BIT - 1))) {
2003-02-28 11:09:08 -05:00
res = fast_s_mp_sqr (a, b);
2004-10-29 18:07:18 -04:00
} else
#endif
#ifdef BN_S_MP_SQR_C
2003-02-28 11:09:08 -05:00
res = s_mp_sqr (a, b);
2004-10-29 18:07:18 -04:00
#else
res = MP_VAL;
#endif
2003-02-28 11:08:34 -05:00
}
b->sign = MP_ZPOS;
return res;
}
2004-10-29 18:07:18 -04:00
#endif
2005-08-01 12:37:28 -04:00
/* $Source$ */
/* $Revision$ */
/* $Date$ */