Mercurial > dropbear

comparison libtommath/bn_mp_reduce_is_2k_l.c @ 1655:f52919ffd3b1

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
update ltm to 1.1.0 and enable FIPS 186.4 compliant key-generation (#79) * make key-generation compliant to FIPS 186.4 * fix includes in tommath_class.h * update fuzzcorpus instead of error-out * fixup fuzzing make-targets * update Makefile.in * apply necessary patches to ltm sources * clean-up not required ltm files * update to vanilla ltm 1.1.0 this already only contains the required files * remove set/get double
author Steffen Jaeckel <s_jaeckel@gmx.de>
date Mon, 16 Sep 2019 15:50:38 +0200
parents 8bba51a55704
children 1051e4eea25a
comparison
equal deleted inserted replaced
1654:cc0fc5131c5c 1655:f52919ffd3b1
1 #include <tommath_private.h> 1 #include "tommath_private.h"
2 #ifdef BN_MP_REDUCE_IS_2K_L_C 2 #ifdef BN_MP_REDUCE_IS_2K_L_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.
7 * 7 *
8 * The library was designed directly after the MPI library by 8 * The library was designed directly after the MPI library by
9 * Michael Fromberger but has been written from scratch with 9 * Michael Fromberger but has been written from scratch with
10 * additional optimizations in place. 10 * additional optimizations in place.
11 * 11 *
12 * The library is free for all purposes without any express 12 * SPDX-License-Identifier: Unlicense
13 * guarantee it works.
14 *
15 * Tom St Denis, [email protected], http://libtom.org
16 */ 13 */
17 14
18 /* determines if reduce_2k_l can be used */ 15 /* determines if reduce_2k_l can be used */
19 int mp_reduce_is_2k_l(mp_int *a) 16 int mp_reduce_is_2k_l(const mp_int *a)
20 { 17 {
21 int ix, iy; 18 int ix, iy;
22 19
23 if (a->used == 0) { 20 if (a->used == 0) {
24 return MP_NO; 21 return MP_NO;
25 } else if (a->used == 1) { 22 } else if (a->used == 1) {
26 return MP_YES; 23 return MP_YES;
27 } else if (a->used > 1) { 24 } else if (a->used > 1) {
28 /* if more than half of the digits are -1 we're sold */ 25 /* if more than half of the digits are -1 we're sold */
29 for (iy = ix = 0; ix < a->used; ix++) { 26 for (iy = ix = 0; ix < a->used; ix++) {
30 if (a->dp[ix] == MP_MASK) { 27 if (a->dp[ix] == MP_MASK) {
31 ++iy; 28 ++iy;
32 } 29 }
33 } 30 }
34 return (iy >= (a->used/2)) ? MP_YES : MP_NO; 31 return (iy >= (a->used/2)) ? MP_YES : MP_NO;
35 32
36 } 33 }
37 return MP_NO; 34 return MP_NO;
38 } 35 }
39 36
40 #endif 37 #endif
41 38
42 /* ref: $Format:%D$ */ 39 /* ref: HEAD -> master, tag: v1.1.0 */
43 /* git commit: $Format:%H$ */ 40 /* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
44 /* commit time: $Format:%ai$ */ 41 /* commit time: 2019-01-28 20:32:32 +0100 */