tommath/bn_mp_reduce_2k_l.c

65 lines
1.4 KiB
C
Raw Normal View History

#include <tommath_private.h>
2005-02-12 03:40:15 -05:00
#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.
*
* The library is free for all purposes without any express
* guarantee it works.
*
* Tom St Denis, tstdenis82@gmail.com, http://libtom.org
2005-02-12 03:40:15 -05:00
*/
2015-11-11 19:18:15 -05:00
/* reduces a modulo n where n is of the form 2**p - d
2005-02-12 03:40:15 -05:00
This differs from reduce_2k since "d" can be larger
than a single digit.
*/
int mp_reduce_2k_l(mp_int *a, mp_int *n, mp_int *d)
{
mp_int q;
int p, res;
2015-11-11 19:18:15 -05:00
2005-02-12 03:40:15 -05:00
if ((res = mp_init(&q)) != MP_OKAY) {
return res;
}
2015-11-11 19:18:15 -05:00
p = mp_count_bits(n);
2005-02-12 03:40:15 -05:00
top:
/* q = a/2**p, a = a mod 2**p */
if ((res = mp_div_2d(a, p, &q, a)) != MP_OKAY) {
goto ERR;
}
2015-11-11 19:18:15 -05:00
2005-02-12 03:40:15 -05:00
/* q = q * d */
2015-11-11 19:18:15 -05:00
if ((res = mp_mul(&q, d, &q)) != MP_OKAY) {
2005-02-12 03:40:15 -05:00
goto ERR;
}
2015-11-11 19:18:15 -05:00
2005-02-12 03:40:15 -05:00
/* a = a + q */
if ((res = s_mp_add(a, &q, a)) != MP_OKAY) {
goto ERR;
}
2015-11-11 19:18:15 -05:00
2005-02-12 03:40:15 -05:00
if (mp_cmp_mag(a, n) != MP_LT) {
if ((res = s_mp_sub(a, n, a)) != MP_OKAY) {
goto ERR;
}
2005-02-12 03:40:15 -05:00
goto top;
}
2015-11-11 19:18:15 -05:00
2005-02-12 03:40:15 -05:00
ERR:
mp_clear(&q);
return res;
}
#endif
2005-08-01 12:37:28 -04:00
2017-08-28 10:27:26 -04:00
/* ref: $Format:%D$ */
/* git commit: $Format:%H$ */
/* commit time: $Format:%ai$ */