libtommath/bn_mp_sqr.c

41 lines
1.1 KiB
C
Raw Normal View History

2003-02-28 16:08:34 +00:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
2003-08-05 01:24:44 +00:00
* LibTomMath is a library that provides multiple-precision
2003-02-28 16:08:34 +00:00
* integer arithmetic as well as number theoretic functionality.
*
2003-08-05 01:24:44 +00:00
* The library was designed directly after the MPI library by
2003-02-28 16:08:34 +00: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-13 02:11:11 +00:00
* Tom St Denis, tomstdenis@iahu.ca, http://math.libtomcrypt.org
2003-02-28 16:08:34 +00:00
*/
#include <tommath.h>
/* computes b = a*a */
int
mp_sqr (mp_int * a, mp_int * b)
{
2003-02-28 16:09:08 +00:00
int res;
2003-08-05 01:24:44 +00:00
/* use Toom-Cook? */
2003-05-29 13:35:26 +00:00
if (a->used >= TOOM_SQR_CUTOFF) {
res = mp_toom_sqr(a, b);
2003-08-05 01:24:44 +00:00
/* Karatsuba? */
2003-05-29 13:35:26 +00:00
} else if (a->used >= KARATSUBA_SQR_CUTOFF) {
2003-02-28 16:08:34 +00:00
res = mp_karatsuba_sqr (a, b);
} else {
2003-08-05 01:24:44 +00:00
/* can we use the fast comba multiplier? */
2003-05-29 13:35:26 +00:00
if ((a->used * 2 + 1) < MP_WARRAY &&
a->used <
(1 << (sizeof(mp_word) * CHAR_BIT - 2*DIGIT_BIT - 1))) {
2003-02-28 16:09:08 +00:00
res = fast_s_mp_sqr (a, b);
} else {
res = s_mp_sqr (a, b);
}
2003-02-28 16:08:34 +00:00
}
b->sign = MP_ZPOS;
return res;
}