mirror of
https://github.com/clearml/dropbear
synced 2025-01-31 02:46:58 +00:00
615ed4e46a
* 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
62 lines
1.4 KiB
C
62 lines
1.4 KiB
C
#include "tommath_private.h"
|
|
#ifdef BN_MP_REDUCE_2K_L_C
|
|
/* LibTomMath, multiple-precision integer library -- Tom St Denis
|
|
*
|
|
* LibTomMath is a library that provides multiple-precision
|
|
* integer arithmetic as well as number theoretic functionality.
|
|
*
|
|
* The library was designed directly after the MPI library by
|
|
* Michael Fromberger but has been written from scratch with
|
|
* additional optimizations in place.
|
|
*
|
|
* SPDX-License-Identifier: Unlicense
|
|
*/
|
|
|
|
/* reduces a modulo n where n is of the form 2**p - d
|
|
This differs from reduce_2k since "d" can be larger
|
|
than a single digit.
|
|
*/
|
|
int mp_reduce_2k_l(mp_int *a, const mp_int *n, const mp_int *d)
|
|
{
|
|
mp_int q;
|
|
int p, res;
|
|
|
|
if ((res = mp_init(&q)) != MP_OKAY) {
|
|
return res;
|
|
}
|
|
|
|
p = mp_count_bits(n);
|
|
top:
|
|
/* q = a/2**p, a = a mod 2**p */
|
|
if ((res = mp_div_2d(a, p, &q, a)) != MP_OKAY) {
|
|
goto LBL_ERR;
|
|
}
|
|
|
|
/* q = q * d */
|
|
if ((res = mp_mul(&q, d, &q)) != MP_OKAY) {
|
|
goto LBL_ERR;
|
|
}
|
|
|
|
/* a = a + q */
|
|
if ((res = s_mp_add(a, &q, a)) != MP_OKAY) {
|
|
goto LBL_ERR;
|
|
}
|
|
|
|
if (mp_cmp_mag(a, n) != MP_LT) {
|
|
if ((res = s_mp_sub(a, n, a)) != MP_OKAY) {
|
|
goto LBL_ERR;
|
|
}
|
|
goto top;
|
|
}
|
|
|
|
LBL_ERR:
|
|
mp_clear(&q);
|
|
return res;
|
|
}
|
|
|
|
#endif
|
|
|
|
/* ref: HEAD -> master, tag: v1.1.0 */
|
|
/* git commit: 08549ad6bc8b0cede0b357a9c341c5c6473a9c55 */
|
|
/* commit time: 2019-01-28 20:32:32 +0100 */
|