On the design of rsa with short secret exponent

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

Volumn 1716, Issue , 1999, Pages 150-164

  Sun, Hung Min ^a   Yang, Wu Chuan ^a   Laih, Chi Sung ^a  

^a NATIONAL CHENG KUNG UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

SECURITY OF DATA;

ENCRYPTION AND DECRYPTION; RSA MODULI; RSA SYSTEMS; SECRET EXPONENTS;

CRYPTOGRAPHY;

EID: 84956867073     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48000-6_13     Document Type: Conference Paper

References (25)

1. D. Boneh and G. Durfee, “Cryptanalysis of RSA with private exponent Proc. of EUROCRYPT’99, LNCS 1592, Springer-Verlag, pp. 1-23, 1999.
2. D. Coppersmith, “Finding a small root of a univariate modular equation”, Proc. of EUROCRYPT’96, LNCS 1070, Springer-Verlag, pp. 155-165, 1996.
3. D. Coppersmith, “Small solutions to polynomial equations, and low exponent RSA vulnerabilities”, Journal of Cryptology, Vol. 10, pp. 233-260, 1997.
4. D. Coppersmith, M. Franklin, J. Patarin, and M. Reiter, “Low-exponent RSA with related messages”, Proc. of EUROCRYPT’96, LNCS 1070, Springer-Verlag, pp. 1-9, 1996.
5. S. Cavallar, W. Lioen, H. te Riele, B. Dodson, A. Lenstra, P. Leyland, P.L. Montgomery, B. Murphy, P. Zimmermann, “Factorization of RSA-140 using the Number Field Sieve”, Proc. of ASIACRYPT’99, Springer-Verlag, 1999. ECMNET Project
6. H. Gilbert, D. Gupta, A. Odlyzko, and J.J. Quisquater, “Attacks on Shamir’s RSA for paranoids”, Information Processing Letters, Vol. 68, pp. 197-199, 1998.
7. J. Hastad, “On using RSA with low exponent in a public key network”, Proc. Of CRYPTO’85, LNCS, Springer-Verlag, pp. 403-408, 1986.
8. J. Hastad, “Solving simultaneous modular equations of low degree”, SIAM J. of Computing, Vol. 17, pp. 336-341, 1988.
9. N. Herstein, Topics in Algebra, Xerox Corporation, 1975.
10. D. Hühnlein, M.J. Jacobson, S. Paulus, and T. Takagi, “A cryptosystem based on non-maximal imaginary quadratic orders with fast decryption”, Proc. Of EUROCRYPT’98, LNCS 1403, Springer-Verlag, pp. 294-307, 1998.
11. M. Joye, J.J. Quisquater, S.M. Yen, and M. Yung, “Security paradoxes: how improving a cryptosystem may weaken it”, Proceedings of the Ninth National Conference on Information Security, Taiwan, pp. 27-32, May 14-15, 1999.
12. A. Lenstra, “Generating RSA moduli with a predetermined portion”, Proc. Of ASIACRYPT’98, LNCS 1514, Springer-Verlag, pp. 1-10, 1998.
13. T. Okamoto and S. Uchiyama, “A new public-key cryptosystem as secure as factoring”, Proc. Of EUROCRYPT’98, LNCS 1403, Springer-Verlag, pp. 308-318, 1998.
14. R. Pinch, “Extending the Wiener attack to RSA-type cryptosystems”, Electronics Letters, Vol. 31, No. 20, pp. 1736-1738, 1995
15. R. Rivest, A. Shamir, and L. Adleman, “A method for obtaining digital signatures and public-key cryptosystems”, Communication of the ACM, Vol. 21, pp. 120-126, 1978.
16. R. Rivest and R. D. Silverman, “Are strong primes needed for RSA?”, in The 1997 RSA Laboratories Seminar series, Seminar Proceedings, 1997.
17. R. Sakai, M. Morii, and M. Kasahara, “New key generation algorithm for RSA cryptosystem”, IEICE Trans. Fundamentals, Vol. E77-A, No. 1, pp. 89-97, 1994
18. A. Shamir, “RSA for paranoids”, CryptoBytes, Vol. 1, No. 3, pp. 1,3-4, 1995.
19. A. Shamir, “Factoring large numbers with the TWINKLE device”, presented at Eurocrypt'99, 1999.
20. R. D. Silverman, “Fast generation of random, strong RSA primes”, CryptoBytes, Vol. 3, No. 1, pp. 9-13, 1997.
21. R. D. Silverman, “The requirement for strong primes in RSA”, RSA Laboratories Technical Note, May 17, 1997.
22. 2q”, Proc. Of CRYPTO’98, LNCS 1462, Springer-Verlag, pp. 318-326, 1998.
23. S.A. Vanstone and R.J. Zuccherato, “Short RSA keys and their generation”, Journal of Cryptology, Vol. 8, pp. 101-114, 1995.
24. E. Verheul and H. van Tilborg, “Cryptanalysis of less short RSA secret exponents”, Applicable Algebra in Engineering, Communication and Computing, Springer-Verlag, Vol. 8, pp. 425-435, 1997.
25. M. Wiener, “Cryptanalysis of short RSA secret exponents”, IEEE Transactions on Information Theory, Vol. 36, No. 3, pp. 553-558, 1990.