Lattice Based Attack on Common Private Exponent RSA
R. SantoshKumar, Narasimham Challa · 2012
Lattice reduction is a powerful concept for solving diverse problems involving point lattices. Lattice reduction has been successfully utilizing in Number Theory, Linear algebra and Cryptology. Not only the existence of lattice based cryptosystems of hard in nature, but also has vulnerabilities by lattice reduction techniques. In this paper, we show that Wiener’s small private exponent attack, when viewed as a heuristic lattice based attack, is extended to attack many instances of RSA when they have the same small private exponent.