Mercurial > dropbear

comparison libtommath/bn_mp_sqr.c @ 1437:871b18fd7065 fuzz

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
merge from main (libtommath/libtomcrypt/curve25510-donna updates)
author Matt Johnston <matt@ucc.asn.au>
date Sat, 24 Jun 2017 22:51:45 +0800
parents 60fc6476e044
children 8bba51a55704
comparison
equal deleted inserted replaced
1432:41dca1e5ea34 1437:871b18fd7065
1 #include <tommath.h> 1 #include <tommath_private.h>
2 #ifdef BN_MP_SQR_C 2 #ifdef BN_MP_SQR_C
3 /* LibTomMath, multiple-precision integer library -- Tom St Denis 3 /* LibTomMath, multiple-precision integer library -- Tom St Denis
4 * 4 *
5 * LibTomMath is a library that provides multiple-precision 5 * LibTomMath is a library that provides multiple-precision
6 * integer arithmetic as well as number theoretic functionality. 6 * integer arithmetic as well as number theoretic functionality.
10 * additional optimizations in place. 10 * additional optimizations in place.
11 * 11 *
12 * The library is free for all purposes without any express 12 * The library is free for all purposes without any express
13 * guarantee it works. 13 * guarantee it works.
14 * 14 *
15 * Tom St Denis, [email protected], http://math.libtomcrypt.com 15 * Tom St Denis, [email protected], http://libtom.org
16 */ 16 */
17 17
18 /* computes b = a*a */ 18 /* computes b = a*a */
19 int 19 int
20 mp_sqr (mp_int * a, mp_int * b) 20 mp_sqr (mp_int * a, mp_int * b)
27 res = mp_toom_sqr(a, b); 27 res = mp_toom_sqr(a, b);
28 /* Karatsuba? */ 28 /* Karatsuba? */
29 } else 29 } else
30 #endif 30 #endif
31 #ifdef BN_MP_KARATSUBA_SQR_C 31 #ifdef BN_MP_KARATSUBA_SQR_C
32 if (a->used >= KARATSUBA_SQR_CUTOFF) { 32 if (a->used >= KARATSUBA_SQR_CUTOFF) {
33 res = mp_karatsuba_sqr (a, b); 33 res = mp_karatsuba_sqr (a, b);
34 } else 34 } else
35 #endif 35 #endif
36 { 36 {
37 #ifdef BN_FAST_S_MP_SQR_C 37 #ifdef BN_FAST_S_MP_SQR_C
38 /* can we use the fast comba multiplier? */ 38 /* can we use the fast comba multiplier? */
39 if ((a->used * 2 + 1) < MP_WARRAY && 39 if ((((a->used * 2) + 1) < MP_WARRAY) &&
40 a->used < 40 (a->used <
41 (1 << (sizeof(mp_word) * CHAR_BIT - 2*DIGIT_BIT - 1))) { 41 (1 << (((sizeof(mp_word) * CHAR_BIT) - (2 * DIGIT_BIT)) - 1)))) {
42 res = fast_s_mp_sqr (a, b); 42 res = fast_s_mp_sqr (a, b);
43 } else 43 } else
44 #endif 44 #endif
45 {
45 #ifdef BN_S_MP_SQR_C 46 #ifdef BN_S_MP_SQR_C
46 res = s_mp_sqr (a, b); 47 res = s_mp_sqr (a, b);
47 #else 48 #else
48 res = MP_VAL; 49 res = MP_VAL;
49 #endif 50 #endif
51 }
50 } 52 }
51 b->sign = MP_ZPOS; 53 b->sign = MP_ZPOS;
52 return res; 54 return res;
53 } 55 }
54 #endif 56 #endif
55 57
56 /* $Source: /cvs/libtom/libtommath/bn_mp_sqr.c,v $ */ 58 /* $Source$ */
57 /* $Revision: 1.3 $ */ 59 /* $Revision$ */
58 /* $Date: 2006/03/31 14:18:44 $ */ 60 /* $Date$ */