Mercurial > dropbear

comparison libtommath/bn_mp_reduce_is_2k_l.c @ 1692:1051e4eea25a

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Update LibTomMath to 1.2.0 (#84) * update C files * update other files * update headers * update makefiles * remove mp_set/get_double() * use ltm 1.2.0 API * update ltm_desc * use bundled tommath if system-tommath is too old * XMALLOC etc. were changed to MP_MALLOC etc.
author Steffen Jaeckel <s@jaeckel.eu>
date Tue, 26 May 2020 17:36:47 +0200
parents f52919ffd3b1
children
comparison
equal deleted inserted replaced
1691:2d3745d58843 1692:1051e4eea25a
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 /* SPDX-License-Identifier: Unlicense */
5 * LibTomMath is a library that provides multiple-precision
6 * integer arithmetic as well as number theoretic functionality.
7 *
8 * The library was designed directly after the MPI library by
9 * Michael Fromberger but has been written from scratch with
10 * additional optimizations in place.
11 *
12 * SPDX-License-Identifier: Unlicense
13 */
14 5
15 /* determines if reduce_2k_l can be used */ 6 /* determines if reduce_2k_l can be used */
16 int mp_reduce_is_2k_l(const mp_int *a) 7 mp_bool mp_reduce_is_2k_l(const mp_int *a)
17 { 8 {
18 int ix, iy; 9 int ix, iy;
19 10
20 if (a->used == 0) { 11 if (a->used == 0) {
21 return MP_NO; 12 return MP_NO;
22 } else if (a->used == 1) { 13 } else if (a->used == 1) {
23 return MP_YES; 14 return MP_YES;
24 } else if (a->used > 1) { 15 } else if (a->used > 1) {
25 /* if more than half of the digits are -1 we're sold */ 16 /* if more than half of the digits are -1 we're sold */
26 for (iy = ix = 0; ix < a->used; ix++) { 17 for (iy = ix = 0; ix < a->used; ix++) {
27 if (a->dp[ix] == MP_MASK) { 18 if (a->dp[ix] == MP_DIGIT_MAX) {
28 ++iy; 19 ++iy;
29 } 20 }
30 } 21 }
31 return (iy >= (a->used/2)) ? MP_YES : MP_NO; 22 return (iy >= (a->used/2)) ? MP_YES : MP_NO;
32 23 } else {
24 return MP_NO;
33 } 25 }
34 return MP_NO;
35 } 26 }
36 27
37 #endif 28 #endif
38
39 /* ref: HEAD -> master, tag: v1.1.0 */
40 /* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
41 /* commit time: 2019-01-28 20:32:32 +0100 */