Sciweavers

38 search results - page 1 / 8
» Approximate Integer Common Divisors
Sort
View
CALC
2001
Springer
171views Cryptology» more  CALC 2001»
13 years 11 months ago
Approximate Integer Common Divisors
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
Nick Howgrave-Graham
AICCSA
2001
IEEE
177views Hardware» more  AICCSA 2001»
13 years 10 months ago
On a Parallel Extended Euclidean Algorithm
A new parallelization of Euclid's greatest common divisor algorithm is proposed. It matches the best existing integer GCD algorithms since it can be achieved in parallel O(n/...
Sidi Mohamed Sedjelmaci
ISSAC
1995
Springer
108views Mathematics» more  ISSAC 1995»
13 years 10 months ago
A Solution to the Extended GCD Problem
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...
Bohdan S. Majewski, George Havas
IACR
2011
141views more  IACR 2011»
12 years 6 months ago
Approximate common divisors via lattices
We analyze the multivariate generalization of Howgrave-Graham’s algorithm for the approximate common divisor problem. In the m-variable case with modulus N and approximate common...
Henry Cohn, Nadia Heninger
ARITH
2005
IEEE
14 years 4 days ago
N-Bit Unsigned Division via N-Bit Multiply-Add
Integer division on modern processors is expensive compared to multiplication. Previous algorithms for performing unsigned division by an invariant divisor, via reciprocal approxi...
Arch D. Robison