Another look at small RSA exponents

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3960 LNCS, Issue , 2006, Pages 82-98

  Hinek, M Jason ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STORAGE EQUIPMENT; INFORMATION ANALYSIS; PUBLIC KEY CRYPTOGRAPHY; ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ATTACKS; PRIVATE EXPONENTS; PRIVATE KEY INFORMATION; PUBLIC EXPONENTS;

COMPUTER CRIME; CRYPTOGRAPHY;

PRIVATE KEY; RSA EXPONENTS;

EID: 33745658869     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11605805_6     Document Type: Conference Paper

References (27)

1. J. Blöiner and A. May. Low secret exponent; RSA revisited. In Cryptography and Lattices - Proceedings of CALC '01, volume 2146 of Lecture Notes in Computer Science, pages 4-19. Springer-Verlag, 2001.
2. J. Blöiner and A. May. New partial key exposure attacks on RSA. In Advances m Cryptology - Proceedings of CRYPTO 2003, volume 2729 of Lecture Notes in Computer Science, pages 27-43. Springer-Verlag, 2003.
3. 0.292. In Advances in Cryptology - Proceedings of EUROCRYPT '99, volume 1592 of Lecture Notes in Computer Science, pages 1-11. Springer-Verlag, 1999.
4. 0.292. IEEE Transactions on Information Theory, 46(4): 1339-1349, July 2000.
5. D. Boneh, G. Durfee, and Y. Frankel. An attack on RSA given a small fraction of the private key bits. In Advances in Cryptology - Proceedings of ASIACRYPT '98, volume 1514 of Lecture Notes in Computer Science, pages 25-34. Springer-Verlag, 1998.
6. D. Boneh, G. Durfee, and Y. Frankel. Exposing an RSA private key given a small fraction of its bits. Revised and extended version of proceedings of ASIACRYPT '98 [5]. Available at http://crypto.stanford.edu/-dabo/abstracts, 2001.
7. D. Boneh and H. Shacham. Fast variants of RSA. Cryptobytes, 5(1):l-9, 2002.
8. D. Coppersmith. Small solutions to polynomial equations, and low exponent RSA vulnerabilities. Journal of Cryptology, 10(4):233-260, 1997.
9. J.-S. Coron. Finding small roots of bivariate integer polynomial equations revisited. In Advances in Cryptology - Proceedings of EUROCRYPT 2004, volume 3027 of Lecture Notes in Computer Science, pages 492-505. Springer-Verlag, 2004.
10. A. Dujella. Continued fractions and RSA with small secret exponent. Tatra Mt. Math. Publ., 29:101-112, 2004.
11. M. Ernst, E. Jochemsz, A. May, arid B. de Weger. Partial key exposure attacks on RSA up to full size exponents. In Advances in Cryptology - Proceedings of EUROCRYPT 2005, volume 3494 of Lecture Notes in Computer Science, pages 371-387. Springer-Verlag, 2005.
12. S. D. Galbraith, C. Heneghan, and J. F. McKee. Tunable balancing of RSA. In Information Security and Privacy, 10th Australasian Conference, ACISP 2005, volume 3574 of Lecture Notes in Computer Science, pages 280-292. Springer, 2005.
13. M. Girault, An identity-based identification scheme based on discrete logorithms modulo a composite number. In Advances in Cryptology - Proceedings of EUROCRYPT '90, volume 473 of Lecture Notes in Computer Science, pages 481-486. Springer-Verlag, 1991
14. N. A. Howgrave-Graham. Finding small roots of univariate modular equations revisited. In Cryptography and Coding, 6th IMA International Conference, Cirencester, UK, December 17-19, 1997, Proceedings, volume 1355 of Lecture Notes in Computer Science, pages 131-142. Springer-Verlag, 1997.
15. A. K. Lenstra. Unbelievable security : Matching AES security using public key systems. In Advances in Cryptology - Proceedings of ASIACRYPT 2001, volume 2248 of Lecture Notes in Computer Science, pages 67-86. Springer-Verlag, 2001.
16. C. H. Lim and P. J. Lee. Security and performance of server-aided RSA computation protocols. In Advances in Cryptology - Proceedings of CRYPTO '95, volume 963 of Lecture Notes in Computer Science, pages 70-83. Springer-Verlag, 1995.
17. A. May. Cryptanalysis of unbalanced RSA with small CRT-exponent. In Advances in Cryptology - Proceedings of CRYPTO 2002, volume 2442 of Lecture Notes in Computer Science, pages 242-256. Springer-Verlag, 2002.
18. rq. In Public Key Cryptograph - PKC 2004, volume 2947 of Lecture Notes in Computer Science, pages 218-230. Springer-Verlag, 2004.
19. J. McKee and R. G. E. Pinch. Further attacks on server-aided RSA cryptosystems. Available at http://citeseer.ist.psu.edu/388295.html, 1998.
20. R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public key cryptosystems. Commun, of the ACM, 21:120-126, 1978.
21. R. Steinfeld, S. Contini, H. Wang, and J. Pieprzyk. Converse results to the Wiener attack on RSA. In Public Key Cryptography - PKC 2005, volume 3386 of Lecture Notes in Computer Science, pages 184-198. Springer-Verlag, 2005.
22. H.-M. Sun, M. J. Hinek, and M.-E. Wu. On the design of rebalanced RSA-CRT. Technical Report CACR 2005-35, Centre for Applied Cryptographic Research, University of Waterloo, 2005. http://www.cacr.math.uwaterloo.ca/.
23. H.-M. Sun and M.-E. Wu. An approach towards rebalanced RSA-CRT with short public exponent. Cryptology ePrint Archive, Report 2005/053, 2005. http://eprint.iacr.org/.
24. H.-M. Sun and C.-T. Yang. RSA with balanced short exponents and its application to entity authentication. In Public Key Cryptography - PKC 2005, volume 3386 of Lecture Notes in Computer Science, pages 199-215. Springer-Verlag, 2005.
25. E. R. Verheul and H. C. A. van Tilborg. Cryptanalysis of 'less short' RSA secret exponents. Appl. Algebra Eng. Commun. Comput., 8(5):425-435, 1997.
26. M. Wiener. Cryptanalysis of short RSA secret exponents. IEEE Transactions on Information Theory, 36(3):553-558, 1990.
27. P. Zimmerman. Integer factoring records, http://www.loria.fr/~zimmerma/ records/factor.html, May 2005.