On the Improvement of Wiener Attack on RSA with Small Private Exponent

Abstract

RSA system is based on the hardness of the integer factorization problem (IFP). Given an RSA modulus N = pq, it is difficult to determine the prime factors p and q efficiently. One of the most famous short exponent attacks on RSA is the Wiener attack. In 1997, Verheul and van Tilborg use an exhaustive search to extend the boundary of the Wiener attack… (More)
DOI: 10.1155/2014/650537

4 Figures and Tables