Lines Matching defs:gcd
1916 Like the old mp_gcd() function, except computes the GCD using the
2018 ... by computing the product, and dividing out the gcd.
2023 mp_int gcd, prod;
2029 if((res = mp_init(&gcd)) != MP_OKAY)
2032 goto GCD;
2036 if((res = mp_gcd(a, b, &gcd)) != MP_OKAY)
2039 res = mp_div(&prod, &gcd, c, NULL);
2043 GCD:
2044 mp_clear(&gcd);
2058 (that is, ax + by = g). This uses the extended binary GCD algorithm
2108 /* Loop through binary GCD algorithm */
