Mercurial > dropbear
comparison libtommath/bn_mp_submod.c @ 1655:f52919ffd3b1
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_SUBMOD_C | 2 #ifdef BN_MP_SUBMOD_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 /* d = a - b (mod c) */ | 15 /* d = a - b (mod c) */ |
19 int | 16 int mp_submod(const mp_int *a, const mp_int *b, const mp_int *c, mp_int *d) |
20 mp_submod (mp_int * a, mp_int * b, mp_int * c, mp_int * d) | |
21 { | 17 { |
22 int res; | 18 int res; |
23 mp_int t; | 19 mp_int t; |
24 | 20 |
25 | 21 |
26 if ((res = mp_init (&t)) != MP_OKAY) { | 22 if ((res = mp_init(&t)) != MP_OKAY) { |
27 return res; | 23 return res; |
28 } | 24 } |
29 | 25 |
30 if ((res = mp_sub (a, b, &t)) != MP_OKAY) { | 26 if ((res = mp_sub(a, b, &t)) != MP_OKAY) { |
31 mp_clear (&t); | 27 mp_clear(&t); |
32 return res; | 28 return res; |
33 } | 29 } |
34 res = mp_mod (&t, c, d); | 30 res = mp_mod(&t, c, d); |
35 mp_clear (&t); | 31 mp_clear(&t); |
36 return res; | 32 return res; |
37 } | 33 } |
38 #endif | 34 #endif |
39 | 35 |
40 /* ref: $Format:%D$ */ | 36 /* ref: HEAD -> master, tag: v1.1.0 */ |
41 /* git commit: $Format:%H$ */ | 37 /* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */ |
42 /* commit time: $Format:%ai$ */ | 38 /* commit time: 2019-01-28 20:32:32 +0100 */ |