Mercurial > dropbear

comparison libtommath/bn_mp_mulmod.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_MULMOD_C 2 #ifdef BN_MP_MULMOD_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 mp_mulmod (mp_int * a, mp_int * b, mp_int * c, mp_int * d) 16 int mp_mulmod(const mp_int *a, const mp_int *b, const mp_int *c, mp_int *d)
20 { 17 {
21 int res; 18 int res;
22 mp_int t; 19 mp_int t;
23 20
24 if ((res = mp_init_size (&t, c->used)) != MP_OKAY) { 21 if ((res = mp_init_size(&t, c->used)) != MP_OKAY) {
25 return res; 22 return res;
26 } 23 }
27 24
28 if ((res = mp_mul (a, b, &t)) != MP_OKAY) { 25 if ((res = mp_mul(a, b, &t)) != MP_OKAY) {
29 mp_clear (&t); 26 mp_clear(&t);
30 return res; 27 return res;
31 } 28 }
32 res = mp_mod (&t, c, d); 29 res = mp_mod(&t, c, d);
33 mp_clear (&t); 30 mp_clear(&t);
34 return res; 31 return res;
35 } 32 }
36 #endif 33 #endif
37 34
38 /* ref: $Format:%D$ */ 35 /* ref: HEAD -> master, tag: v1.1.0 */
39 /* git commit: $Format:%H$ */ 36 /* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
40 /* commit time: $Format:%ai$ */ 37 /* commit time: 2019-01-28 20:32:32 +0100 */