libtommath/bn_mp_invmod.c

28 lines
659 B
C
Raw Normal View History

#include "tommath_private.h"
2004-10-29 22:07:18 +00:00
#ifdef BN_MP_INVMOD_C
2019-04-07 13:29:11 +00:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
/* SPDX-License-Identifier: Unlicense */
2003-02-28 16:08:34 +00:00
2003-07-02 15:39:39 +00:00
/* hac 14.61, pp608 */
2017-09-20 14:59:43 +00:00
int mp_invmod(const mp_int *a, const mp_int *b, mp_int *c)
2003-02-28 16:08:34 +00:00
{
/* b cannot be negative and has to be >1 */
2017-10-15 14:11:09 +00:00
if ((b->sign == MP_NEG) || (mp_cmp_d(b, 1uL) != MP_GT)) {
2017-08-30 17:11:35 +00:00
return MP_VAL;
}
2003-02-28 16:08:34 +00:00
2019-04-12 12:56:29 +00:00
#ifdef BN_S_MP_INVMOD_FAST_C
2017-08-30 17:11:35 +00:00
/* if the modulus is odd we can use a faster routine instead */
if (MP_IS_ODD(b)) {
2019-04-12 12:56:29 +00:00
return s_mp_invmod_fast(a, b, c);
2017-08-30 17:11:35 +00:00
}
2004-10-29 22:07:18 +00:00
#endif
2003-02-28 16:08:34 +00:00
2019-04-12 12:56:29 +00:00
#ifdef BN_S_MP_INVMOD_SLOW_C
return s_mp_invmod_slow(a, b, c);
#else
2017-08-30 17:11:35 +00:00
return MP_VAL;
#endif
2003-02-28 16:08:34 +00:00
}
2004-10-29 22:07:18 +00:00
#endif