28 lines
651 B
C
28 lines
651 B
C
#include "tommath_private.h"
|
|
#ifdef BN_MP_INVMOD_C
|
|
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
|
|
/* SPDX-License-Identifier: Unlicense */
|
|
|
|
/* hac 14.61, pp608 */
|
|
int mp_invmod(const mp_int *a, const mp_int *b, mp_int *c)
|
|
{
|
|
/* b cannot be negative and has to be >1 */
|
|
if ((b->sign == MP_NEG) || (mp_cmp_d(b, 1uL) != MP_GT)) {
|
|
return MP_VAL;
|
|
}
|
|
|
|
#ifdef BN_FAST_MP_INVMOD_C
|
|
/* if the modulus is odd we can use a faster routine instead */
|
|
if (MP_IS_ODD(b)) {
|
|
return fast_mp_invmod(a, b, c);
|
|
}
|
|
#endif
|
|
|
|
#ifdef BN_MP_INVMOD_SLOW_C
|
|
return mp_invmod_slow(a, b, c);
|
|
#else
|
|
return MP_VAL;
|
|
#endif
|
|
}
|
|
#endif
|