1
0
mirror of http://galexander.org/git/simplesshd.git synced 2024-11-27 17:58:13 +00:00
simplesshd/dropbear/libtommath/bn_mp_invmod.c

44 lines
1.1 KiB
C
Raw Normal View History

2019-06-09 20:44:26 +00:00
#include <tommath_private.h>
2014-12-10 21:56:49 +00:00
#ifdef BN_MP_INVMOD_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.
*
2019-06-09 20:44:26 +00:00
* Tom St Denis, tstdenis82@gmail.com, http://libtom.org
2014-12-10 21:56:49 +00:00
*/
/* hac 14.61, pp608 */
int mp_invmod (mp_int * a, mp_int * b, mp_int * c)
{
/* b cannot be negative */
2019-06-09 20:44:26 +00:00
if ((b->sign == MP_NEG) || (mp_iszero(b) == MP_YES)) {
2014-12-10 21:56:49 +00:00
return MP_VAL;
}
#ifdef BN_FAST_MP_INVMOD_C
/* if the modulus is odd we can use a faster routine instead */
2019-06-09 20:44:26 +00:00
if ((mp_isodd(b) == MP_YES) && (mp_cmp_d(b, 1) != MP_EQ)) {
2014-12-10 21:56:49 +00:00
return fast_mp_invmod (a, b, c);
}
#endif
#ifdef BN_MP_INVMOD_SLOW_C
return mp_invmod_slow(a, b, c);
2019-06-09 20:44:26 +00:00
#else
2014-12-10 21:56:49 +00:00
return MP_VAL;
2019-06-09 20:44:26 +00:00
#endif
2014-12-10 21:56:49 +00:00
}
#endif
2019-06-09 20:44:26 +00:00
/* ref: $Format:%D$ */
/* git commit: $Format:%H$ */
/* commit time: $Format:%ai$ */