tommath/bn_fast_mp_invmod.c

149 lines
3.3 KiB
C
Raw Normal View History

#include <tommath_private.h>
2004-10-29 18:07:18 -04:00
#ifdef BN_FAST_MP_INVMOD_C
2003-02-28 11:08:34 -05:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis
*
2003-08-04 21:24:44 -04:00
* LibTomMath is a library that provides multiple-precision
2003-02-28 11:08:34 -05:00
* integer arithmetic as well as number theoretic functionality.
*
2003-08-04 21:24:44 -04:00
* The library was designed directly after the MPI library by
2003-02-28 11:08:34 -05:00
* 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
2003-02-28 11:08:34 -05:00
*/
2003-02-28 11:09:08 -05:00
/* computes the modular inverse via binary extended euclidean algorithm,
* that is c = 1/a mod b
*
2004-10-29 18:07:18 -04:00
* Based on slow invmod except this is optimized for the case where b is
2003-02-28 11:09:08 -05:00
* odd as per HAC Note 14.64 on pp. 610
*/
2005-02-12 03:40:15 -05:00
int fast_mp_invmod (mp_int * a, mp_int * b, mp_int * c)
2003-02-28 11:08:34 -05:00
{
2003-02-28 11:09:08 -05:00
mp_int x, y, u, v, B, D;
int res, neg;
2003-02-28 11:08:34 -05:00
2003-12-24 13:59:22 -05:00
/* 2. [modified] b must be odd */
2015-10-25 11:34:43 -04:00
if (mp_iseven (b) == MP_YES) {
2003-08-04 21:24:44 -04:00
return MP_VAL;
}
2003-03-29 13:16:01 -05:00
/* init all our temps */
2003-05-17 08:33:54 -04:00
if ((res = mp_init_multi(&x, &y, &u, &v, &B, &D, NULL)) != MP_OKAY) {
return res;
2003-02-28 11:08:34 -05:00
}
/* x == modulus, y == value to invert */
if ((res = mp_copy (b, &x)) != MP_OKAY) {
2004-12-22 21:40:37 -05:00
goto LBL_ERR;
2003-02-28 11:08:34 -05:00
}
2003-05-17 08:33:54 -04:00
/* we need y = |a| */
2005-03-12 06:55:11 -05:00
if ((res = mp_mod (a, b, &y)) != MP_OKAY) {
2004-12-22 21:40:37 -05:00
goto LBL_ERR;
2003-02-28 11:08:34 -05:00
}
/* 3. u=x, v=y, A=1, B=0, C=0,D=1 */
if ((res = mp_copy (&x, &u)) != MP_OKAY) {
2004-12-22 21:40:37 -05:00
goto LBL_ERR;
2003-02-28 11:08:34 -05:00
}
if ((res = mp_copy (&y, &v)) != MP_OKAY) {
2004-12-22 21:40:37 -05:00
goto LBL_ERR;
2003-02-28 11:08:34 -05:00
}
mp_set (&D, 1);
top:
/* 4. while u is even do */
2015-10-25 11:34:43 -04:00
while (mp_iseven (&u) == MP_YES) {
2003-02-28 11:08:34 -05:00
/* 4.1 u = u/2 */
if ((res = mp_div_2 (&u, &u)) != MP_OKAY) {
2004-12-22 21:40:37 -05:00
goto LBL_ERR;
2003-02-28 11:08:34 -05:00
}
2003-07-02 11:39:39 -04:00
/* 4.2 if B is odd then */
2015-10-25 11:34:43 -04:00
if (mp_isodd (&B) == MP_YES) {
2003-02-28 11:08:34 -05:00
if ((res = mp_sub (&B, &x, &B)) != MP_OKAY) {
2004-12-22 21:40:37 -05:00
goto LBL_ERR;
2003-02-28 11:08:34 -05:00
}
}
2003-03-29 13:16:01 -05:00
/* B = B/2 */
2003-02-28 11:08:34 -05:00
if ((res = mp_div_2 (&B, &B)) != MP_OKAY) {
2004-12-22 21:40:37 -05:00
goto LBL_ERR;
2003-02-28 11:08:34 -05:00
}
}
/* 5. while v is even do */
2015-10-25 11:34:43 -04:00
while (mp_iseven (&v) == MP_YES) {
2003-02-28 11:08:34 -05:00
/* 5.1 v = v/2 */
if ((res = mp_div_2 (&v, &v)) != MP_OKAY) {
2004-12-22 21:40:37 -05:00
goto LBL_ERR;
2003-02-28 11:08:34 -05:00
}
2003-07-02 11:39:39 -04:00
/* 5.2 if D is odd then */
2015-10-25 11:34:43 -04:00
if (mp_isodd (&D) == MP_YES) {
2003-03-29 13:16:01 -05:00
/* D = (D-x)/2 */
2003-02-28 11:08:34 -05:00
if ((res = mp_sub (&D, &x, &D)) != MP_OKAY) {
2004-12-22 21:40:37 -05:00
goto LBL_ERR;
2003-02-28 11:08:34 -05:00
}
}
2003-03-29 13:16:01 -05:00
/* D = D/2 */
2003-02-28 11:08:34 -05:00
if ((res = mp_div_2 (&D, &D)) != MP_OKAY) {
2004-12-22 21:40:37 -05:00
goto LBL_ERR;
2003-02-28 11:08:34 -05:00
}
}
/* 6. if u >= v then */
if (mp_cmp (&u, &v) != MP_LT) {
2003-03-29 13:16:01 -05:00
/* u = u - v, B = B - D */
2003-02-28 11:08:34 -05:00
if ((res = mp_sub (&u, &v, &u)) != MP_OKAY) {
2004-12-22 21:40:37 -05:00
goto LBL_ERR;
2003-02-28 11:08:34 -05:00
}
if ((res = mp_sub (&B, &D, &B)) != MP_OKAY) {
2004-12-22 21:40:37 -05:00
goto LBL_ERR;
2003-02-28 11:08:34 -05:00
}
} else {
2003-03-29 13:16:01 -05:00
/* v - v - u, D = D - B */
2003-02-28 11:08:34 -05:00
if ((res = mp_sub (&v, &u, &v)) != MP_OKAY) {
2004-12-22 21:40:37 -05:00
goto LBL_ERR;
2003-02-28 11:08:34 -05:00
}
if ((res = mp_sub (&D, &B, &D)) != MP_OKAY) {
2004-12-22 21:40:37 -05:00
goto LBL_ERR;
2003-02-28 11:08:34 -05:00
}
}
/* if not zero goto step 4 */
2015-10-25 11:34:43 -04:00
if (mp_iszero (&u) == MP_NO) {
2003-02-28 11:08:34 -05:00
goto top;
2003-02-28 11:09:08 -05:00
}
2003-02-28 11:08:34 -05:00
/* now a = C, b = D, gcd == g*v */
/* if v != 1 then there is no inverse */
if (mp_cmp_d (&v, 1) != MP_EQ) {
res = MP_VAL;
2004-12-22 21:40:37 -05:00
goto LBL_ERR;
2003-02-28 11:08:34 -05:00
}
/* b is now the inverse */
neg = a->sign;
while (D.sign == MP_NEG) {
if ((res = mp_add (&D, b, &D)) != MP_OKAY) {
2004-12-22 21:40:37 -05:00
goto LBL_ERR;
2003-02-28 11:08:34 -05:00
}
}
mp_exch (&D, c);
c->sign = neg;
res = MP_OKAY;
2004-12-22 21:40:37 -05:00
LBL_ERR:mp_clear_multi (&x, &y, &u, &v, &B, &D, NULL);
2003-02-28 11:08:34 -05:00
return res;
}
2004-10-29 18:07:18 -04:00
#endif
2005-08-01 12:37:28 -04:00
/* $Source$ */
/* $Revision$ */
/* $Date$ */