Cryptanalysis of RSA with Private Key d Less Than N^0.292 (2000)
by
Dan Boneh
,
Glenn Durfee
| Venue: | IEEE Transactions on Information Theory |
| Citations: | 85 - 5 self |
BibTeX
@ARTICLE{Boneh00cryptanalysisof,
author = {Dan Boneh and Glenn Durfee},
title = {Cryptanalysis of RSA with Private Key d Less Than N^0.292},
journal = {IEEE Transactions on Information Theory},
year = {2000},
volume = {46},
pages = {1339--1349}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We show that if the private exponent d used in the RSA public-key cryptosystem is less than N^0.292 then the system is insecure. This is the first improvement over an old result of Wiener showing that when d is less than N^0.25 the RSA system is insecure. We hope our approach can be used to eventually improve the bound to d less than N^0.5.
Citations
| 2507 | A method for obtaining digital signatures and public-key cryptosystems - Rivest, Shamir, et al. |
| 113 | Cryptanalysis of short RSA secret exponents - Wiener - 1990 |
| 89 | An Algorithmic Theory of Numbers, Graphs and Convexity - Lovasz - 1986 |
| 61 | Solving simultaneous modular equations of low degree - Hastad - 1988 |
| 50 | Finding small roots of univariate modular equations revisited - Howgrave-Graham - 1997 |
| 48 | Lattice reduction: A toolbox for the cryptanalyst - Joux, Stern - 1998 |
| 23 | On the Security of the KMOV public key cryptosystem - Bleichenbacher |
| 21 | van Tilborg, Cryptanalysis of ‘less short’ RSA secret exponents - Verheul, A - 1997 |
| 12 | RSA for paranoids - Shamir - 1995 |
| 11 | On finding small solutions of modular multivariate polynomial equations - Jutla - 1998 |
