Mercurial > dropbear
comparison bn_mp_sqr.c @ 2:86e0b50a9b58 libtommath-orig ltm-0.30-orig
ltm 0.30 orig import
author | Matt Johnston <matt@ucc.asn.au> |
---|---|
date | Mon, 31 May 2004 18:25:22 +0000 |
parents | |
children | d29b64170cf0 |
comparison
equal
deleted
inserted
replaced
-1:000000000000 | 2:86e0b50a9b58 |
---|---|
1 /* LibTomMath, multiple-precision integer library -- Tom St Denis | |
2 * | |
3 * LibTomMath is a library that provides multiple-precision | |
4 * integer arithmetic as well as number theoretic functionality. | |
5 * | |
6 * The library was designed directly after the MPI library by | |
7 * Michael Fromberger but has been written from scratch with | |
8 * additional optimizations in place. | |
9 * | |
10 * The library is free for all purposes without any express | |
11 * guarantee it works. | |
12 * | |
13 * Tom St Denis, [email protected], http://math.libtomcrypt.org | |
14 */ | |
15 #include <tommath.h> | |
16 | |
17 /* computes b = a*a */ | |
18 int | |
19 mp_sqr (mp_int * a, mp_int * b) | |
20 { | |
21 int res; | |
22 | |
23 /* use Toom-Cook? */ | |
24 if (a->used >= TOOM_SQR_CUTOFF) { | |
25 res = mp_toom_sqr(a, b); | |
26 /* Karatsuba? */ | |
27 } else if (a->used >= KARATSUBA_SQR_CUTOFF) { | |
28 res = mp_karatsuba_sqr (a, b); | |
29 } else { | |
30 /* can we use the fast comba multiplier? */ | |
31 if ((a->used * 2 + 1) < MP_WARRAY && | |
32 a->used < | |
33 (1 << (sizeof(mp_word) * CHAR_BIT - 2*DIGIT_BIT - 1))) { | |
34 res = fast_s_mp_sqr (a, b); | |
35 } else { | |
36 res = s_mp_sqr (a, b); | |
37 } | |
38 } | |
39 b->sign = MP_ZPOS; | |
40 return res; | |
41 } |