Mercurial > dropbear

comparison libtommath/bn_mp_mod.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_MOD_C 2 #ifdef BN_MP_MOD_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 /* c = a mod b, 0 <= c < b if b > 0, b < c <= 0 if b < 0 */ 15 /* c = a mod b, 0 <= c < b if b > 0, b < c <= 0 if b < 0 */
19 int 16 int mp_mod(const mp_int *a, const mp_int *b, mp_int *c)
20 mp_mod (mp_int * a, mp_int * b, mp_int * c)
21 { 17 {
22 mp_int t; 18 mp_int t;
23 int res; 19 int res;
24 20
25 if ((res = mp_init_size (&t, b->used)) != MP_OKAY) { 21 if ((res = mp_init_size(&t, b->used)) != MP_OKAY) {
26 return res; 22 return res;
27 } 23 }
28 24
29 if ((res = mp_div (a, b, NULL, &t)) != MP_OKAY) { 25 if ((res = mp_div(a, b, NULL, &t)) != MP_OKAY) {
30 mp_clear (&t); 26 mp_clear(&t);
31 return res; 27 return res;
32 } 28 }
33 29
34 if ((mp_iszero(&t) != MP_NO) || (t.sign == b->sign)) { 30 if ((mp_iszero(&t) != MP_NO) || (t.sign == b->sign)) {
35 res = MP_OKAY; 31 res = MP_OKAY;
36 mp_exch (&t, c); 32 mp_exch(&t, c);
37 } else { 33 } else {
38 res = mp_add (b, &t, c); 34 res = mp_add(b, &t, c);
39 } 35 }
40 36
41 mp_clear (&t); 37 mp_clear(&t);
42 return res; 38 return res;
43 } 39 }
44 #endif 40 #endif
45 41
46 /* ref: $Format:%D$ */ 42 /* ref: HEAD -> master, tag: v1.1.0 */
47 /* git commit: $Format:%H$ */ 43 /* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
48 /* commit time: $Format:%ai$ */ 44 /* commit time: 2019-01-28 20:32:32 +0100 */