Mercurial > dropbear

comparison libtommath/bn_mp_sqrmod.c @ 1739:13d834efc376 fuzz

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
merge from main
author Matt Johnston <matt@ucc.asn.au>
date Thu, 15 Oct 2020 19:55:15 +0800
parents 1051e4eea25a
children
comparison
equal deleted inserted replaced
1562:768ebf737aa0 1739:13d834efc376
1 #include <tommath_private.h> 1 #include "tommath_private.h"
2 #ifdef BN_MP_SQRMOD_C 2 #ifdef BN_MP_SQRMOD_C
3 /* LibTomMath, multiple-precision integer library -- Tom St Denis 3 /* LibTomMath, multiple-precision integer library -- Tom St Denis */
4 * 4 /* SPDX-License-Identifier: Unlicense */
5 * LibTomMath is a library that provides multiple-precision
6 * integer arithmetic as well as number theoretic functionality.
7 *
8 * The library was designed directly after the MPI library by
9 * Michael Fromberger but has been written from scratch with
10 * additional optimizations in place.
11 *
12 * The library is free for all purposes without any express
13 * guarantee it works.
14 *
15 * Tom St Denis, [email protected], http://libtom.org
16 */
17 5
18 /* c = a * a (mod b) */ 6 /* c = a * a (mod b) */
19 int 7 mp_err mp_sqrmod(const mp_int *a, const mp_int *b, mp_int *c)
20 mp_sqrmod (mp_int * a, mp_int * b, mp_int * c)
21 { 8 {
22 int res; 9 mp_err err;
23 mp_int t; 10 mp_int t;
24 11
25 if ((res = mp_init (&t)) != MP_OKAY) { 12 if ((err = mp_init(&t)) != MP_OKAY) {
26 return res; 13 return err;
27 } 14 }
28 15
29 if ((res = mp_sqr (a, &t)) != MP_OKAY) { 16 if ((err = mp_sqr(a, &t)) != MP_OKAY) {
30 mp_clear (&t); 17 goto LBL_ERR;
31 return res; 18 }
32 } 19 err = mp_mod(&t, b, c);
33 res = mp_mod (&t, b, c); 20
34 mp_clear (&t); 21 LBL_ERR:
35 return res; 22 mp_clear(&t);
23 return err;
36 } 24 }
37 #endif 25 #endif
38
39 /* ref: $Format:%D$ */
40 /* git commit: $Format:%H$ */
41 /* commit time: $Format:%ai$ */