358 search results - page 2 / 72 » GCD of Many Integers |
ANTS
1998
Springer
13 years 9 months ago
1998
Springer
ISSAC
1995
Springer
13 years 8 months ago
1995
Springer
An improved method for expressing the greatest common divisor of n numbers as an integer linear combination of the numbers is presented and analyzed, both theoretically and practi...
ISSAC
2005
Springer
13 years 10 months ago
2005
Springer
Over the past few decades several variations on a “half GCD” algorithm for obtaining the pair of terms in the middle of a Euclidean sequence have been proposed. In the integer...
ANTS
2004
Springer
13 years 10 months ago
2004
Springer
The binary algorithm is a variant of the Euclidean algorithm that performs well in practice. We present a quasi-linear time recursive algorithm that computes the greatest common di...
EUROCRYPT
2012
Springer
11 years 7 months ago
2012
Springer
We describe a compression technique that reduces the public key size of van Dijk, Gentry, Halevi and Vaikuntanathan’s (DGHV) fully homomorphic scheme over the integers from ˜O(...