Sciweavers

3 search results - page 1 / 1
» Approximate common divisors via lattices
Sort
View
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
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
ARITH
2005
IEEE
14 years 19 hour 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