libtommath/mp_exteuclid.c

73 lines
2.6 KiB
C
Raw Permalink Normal View History

#include "tommath_private.h"
#ifdef MP_EXTEUCLID_C
2019-04-07 13:29:11 +00:00
/* LibTomMath, multiple-precision integer library -- Tom St Denis */
/* SPDX-License-Identifier: Unlicense */
2004-04-11 20:46:22 +00:00
2015-11-12 00:18:15 +00:00
/* Extended euclidean algorithm of (a, b) produces
2004-04-11 20:46:22 +00:00
a*u1 + b*u2 = u3
*/
mp_err mp_exteuclid(const mp_int *a, const mp_int *b, mp_int *U1, mp_int *U2, mp_int *U3)
2004-04-11 20:46:22 +00:00
{
2017-08-28 19:40:10 +00:00
mp_int u1, u2, u3, v1, v2, v3, t1, t2, t3, q, tmp;
mp_err err;
2004-04-11 20:46:22 +00:00
if ((err = mp_init_multi(&u1, &u2, &u3, &v1, &v2, &v3, &t1, &t2, &t3, &q, &tmp, NULL)) != MP_OKAY) {
return err;
}
/* initialize, (u1,u2,u3) = (1,0,a) */
2017-10-15 14:11:09 +00:00
mp_set(&u1, 1uL);
2019-09-04 06:40:39 +00:00
if ((err = mp_copy(a, &u3)) != MP_OKAY) goto LBL_ERR;
2004-04-11 20:46:22 +00:00
/* initialize, (v1,v2,v3) = (0,1,b) */
2017-10-15 14:11:09 +00:00
mp_set(&v2, 1uL);
2019-09-04 06:40:39 +00:00
if ((err = mp_copy(b, &v3)) != MP_OKAY) goto LBL_ERR;
2004-04-11 20:46:22 +00:00
/* loop while v3 != 0 */
2019-10-24 15:43:31 +00:00
while (!mp_iszero(&v3)) {
2017-08-30 17:19:29 +00:00
/* q = u3/v3 */
2019-09-04 06:40:39 +00:00
if ((err = mp_div(&u3, &v3, &q, NULL)) != MP_OKAY) goto LBL_ERR;
2004-04-11 20:46:22 +00:00
2017-08-30 17:19:29 +00:00
/* (t1,t2,t3) = (u1,u2,u3) - (v1,v2,v3)q */
2019-09-04 06:40:39 +00:00
if ((err = mp_mul(&v1, &q, &tmp)) != MP_OKAY) goto LBL_ERR;
if ((err = mp_sub(&u1, &tmp, &t1)) != MP_OKAY) goto LBL_ERR;
if ((err = mp_mul(&v2, &q, &tmp)) != MP_OKAY) goto LBL_ERR;
if ((err = mp_sub(&u2, &tmp, &t2)) != MP_OKAY) goto LBL_ERR;
if ((err = mp_mul(&v3, &q, &tmp)) != MP_OKAY) goto LBL_ERR;
if ((err = mp_sub(&u3, &tmp, &t3)) != MP_OKAY) goto LBL_ERR;
2004-04-11 20:46:22 +00:00
2017-08-30 17:19:29 +00:00
/* (u1,u2,u3) = (v1,v2,v3) */
2019-09-04 06:40:39 +00:00
if ((err = mp_copy(&v1, &u1)) != MP_OKAY) goto LBL_ERR;
if ((err = mp_copy(&v2, &u2)) != MP_OKAY) goto LBL_ERR;
if ((err = mp_copy(&v3, &u3)) != MP_OKAY) goto LBL_ERR;
2004-04-11 20:46:22 +00:00
2017-08-30 17:19:29 +00:00
/* (v1,v2,v3) = (t1,t2,t3) */
2019-09-04 06:40:39 +00:00
if ((err = mp_copy(&t1, &v1)) != MP_OKAY) goto LBL_ERR;
if ((err = mp_copy(&t2, &v2)) != MP_OKAY) goto LBL_ERR;
if ((err = mp_copy(&t3, &v3)) != MP_OKAY) goto LBL_ERR;
2004-04-11 20:46:22 +00:00
}
2005-03-12 11:55:11 +00:00
/* make sure U3 >= 0 */
if (mp_isneg(&u3)) {
2019-09-04 06:40:39 +00:00
if ((err = mp_neg(&u1, &u1)) != MP_OKAY) goto LBL_ERR;
if ((err = mp_neg(&u2, &u2)) != MP_OKAY) goto LBL_ERR;
if ((err = mp_neg(&u3, &u3)) != MP_OKAY) goto LBL_ERR;
2005-03-12 11:55:11 +00:00
}
2004-04-11 20:46:22 +00:00
/* copy result out */
2017-08-30 17:19:29 +00:00
if (U1 != NULL) {
mp_exch(U1, &u1);
}
if (U2 != NULL) {
mp_exch(U2, &u2);
}
if (U3 != NULL) {
mp_exch(U3, &u3);
}
2004-04-11 20:46:22 +00:00
LBL_ERR:
mp_clear_multi(&u1, &u2, &u3, &v1, &v2, &v3, &t1, &t2, &t3, &q, &tmp, NULL);
2004-04-11 20:46:22 +00:00
return err;
}
2004-10-29 22:07:18 +00:00
#endif