Mercurial > dropbear

comparison libtommath/bn_mp_reduce_setup.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_SETUP_C 2 #ifdef BN_MP_REDUCE_SETUP_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 /* pre-calculate the value required for Barrett reduction 15 /* pre-calculate the value required for Barrett reduction
19 * For a given modulus "b" it calulates the value required in "a" 16 * For a given modulus "b" it calulates the value required in "a"
20 */ 17 */
21 int mp_reduce_setup (mp_int * a, mp_int * b) 18 int mp_reduce_setup(mp_int *a, const mp_int *b)
22 { 19 {
23 int res; 20 int res;
24 21
25 if ((res = mp_2expt (a, b->used * 2 * DIGIT_BIT)) != MP_OKAY) { 22 if ((res = mp_2expt(a, b->used * 2 * DIGIT_BIT)) != MP_OKAY) {
26 return res; 23 return res;
27 } 24 }
28 return mp_div (a, b, a, NULL); 25 return mp_div(a, b, a, NULL);
29 } 26 }
30 #endif 27 #endif
31 28
32 /* ref: $Format:%D$ */ 29 /* ref: HEAD -> master, tag: v1.1.0 */
33 /* git commit: $Format:%H$ */ 30 /* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
34 /* commit time: $Format:%ai$ */ 31 /* commit time: 2019-01-28 20:32:32 +0100 */