Lattice based Attacks on Small Private Exponent of RSA: A Survey
R. SantoshKumar, C. Narasimham, S. Pallam Setty · International Journal of Computer Applications · 2012
Lattice basis reduction algorithms have contributed a lot to cryptanalysis of RSA crypto system.With coppersmith's theory of polynomials, these algorithms are searching for the weak instances of Number-theoretic cryptography, mainly RSA.In this paper we present several lattice based attacks on low private exponent of RSA.