Minkowski's convex body theorem and integer programming
Mathematics of Operations Research
Complexity of Lattice Problems
Complexity of Lattice Problems
Fault attacks against EMV signatures
CT-RSA'10 Proceedings of the 2010 international conference on Topics in Cryptology
Attacking the Pollard Generator
IEEE Transactions on Information Theory
| Hi-index | 0.00 |
We present an algorithm that recovers a decomposition of an integer N as sum of two squares from an approximation to one of the summands. It is based on Coppersmith's linearization technique which, applied directly to this problem, requires an approximation error smaller than N^1^/^6. Our algorithm performs a two-round linearization and allows approximation errors up to N^1^/^4.