Cryptanalysis of RSA with Private Key Less Than
Dan Boneh, Glenn Durfee · 2000
We show that if the private exponent used in the RSA (Rivest-Shamir-Adleman) public-key cryptosystem is less than then the system is insecure. This is the first improve- ment over an old result of Wiener showing that when is less than the RSA system is insecure. We hope our approach can be used to eventually improve the bound to less than . Index Terms—Cryptanalysis, lattice basis reduction, LLL, low- exponent RSA, RSA.