Mercurial > dropbear

comparison libtommath/bn_mp_dr_is_modulus.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_DR_IS_MODULUS_C 2 #ifdef BN_MP_DR_IS_MODULUS_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 a number is a valid DR modulus */ 15 /* determines if a number is a valid DR modulus */
19 int mp_dr_is_modulus(mp_int *a) 16 int mp_dr_is_modulus(const mp_int *a)
20 { 17 {
21 int ix; 18 int ix;
22 19
23 /* must be at least two digits */ 20 /* must be at least two digits */
24 if (a->used < 2) { 21 if (a->used < 2) {
27 24
28 /* must be of the form b**k - a [a <= b] so all 25 /* must be of the form b**k - a [a <= b] so all
29 * but the first digit must be equal to -1 (mod b). 26 * but the first digit must be equal to -1 (mod b).
30 */ 27 */
31 for (ix = 1; ix < a->used; ix++) { 28 for (ix = 1; ix < a->used; ix++) {
32 if (a->dp[ix] != MP_MASK) { 29 if (a->dp[ix] != MP_MASK) {
33 return 0; 30 return 0;
34 } 31 }
35 } 32 }
36 return 1; 33 return 1;
37 } 34 }
38 35
39 #endif 36 #endif
40 37
41 /* ref: $Format:%D$ */ 38 /* ref: HEAD -> master, tag: v1.1.0 */
42 /* git commit: $Format:%H$ */ 39 /* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
43 /* commit time: $Format:%ai$ */ 40 /* commit time: 2019-01-28 20:32:32 +0100 */