3 /* LibTomMath, multiple-precision integer library -- Tom St Denis
5 * LibTomMath is a library that provides multiple-precision
6 * integer arithmetic as well as number theoretic functionality.
8 * The library was designed directly after the MPI library by
9 * Michael Fromberger but has been written from scratch with
10 * additional optimizations in place.
12 * The library is free for all purposes without any express
15 * Tom St Denis, tomstdenis@gmail.com, http://math.libtomcrypt.com
18 /* computes least common multiple as |a*b|/(a, b) */
19 int mp_lcm (mp_int * a, mp_int * b, mp_int * c)
25 if ((res = mp_init_multi (&t1, &t2, NULL)) != MP_OKAY) {
29 /* t1 = get the GCD of the two inputs */
30 if ((res = mp_gcd (a, b, &t1)) != MP_OKAY) {
34 /* divide the smallest by the GCD */
35 if (mp_cmp_mag(a, b) == MP_LT) {
36 /* store quotient in t2 such that t2 * b is the LCM */
37 if ((res = mp_div(a, &t1, &t2, NULL)) != MP_OKAY) {
40 res = mp_mul(b, &t2, c);
42 /* store quotient in t2 such that t2 * a is the LCM */
43 if ((res = mp_div(b, &t1, &t2, NULL)) != MP_OKAY) {
46 res = mp_mul(a, &t2, c);
49 /* fix the sign to positive */
53 mp_clear_multi (&t1, &t2, NULL);
58 /* $Source: /cvs/libtom/libtommath/bn_mp_lcm.c,v $ */
59 /* $Revision: 1.3 $ */
60 /* $Date: 2006/03/31 14:18:44 $ */