A new RSA vulnerability using continued fractions

AICCSA 08 - 6th IEEE/ACS International Conference on Computer Systems and Applications

Volumn , Issue , 2008, Pages 694-701

  Nassr, Dieaa I ^a   Bahig, Hatem M ^a   Bhery, Ashraf ^a   Daoud, Sameh S ^a  

^a Ain Shams University   (Egypt)

Author keywords

Continued fractions; Coppersmith's method; Lattice basis reduction; Low exponent RSA; RSA; Wiener's attack

Indexed keywords

COMPUTER SYSTEMS;

CONTINUED FRACTIONS; COPPERSMITH'S METHOD; INTERNATIONAL CONFERENCES; LATTICE BASIS REDUCTION; LOW EXPONENT RSA; PUBLIC KEY; RSA; WIENER'S ATTACK;

COMPUTER APPLICATIONS;

EID: 50049087279     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AICCSA.2008.4493604     Document Type: Conference Paper

References (22)

1. J. Blömer, A. May "Low secret exponent RSA revisited", In Cryptography and Lattices - Proceedings of CALC '01, Lecture Notes in Computer Science, Springer-Verlag 2146, pp. 4-19, 2001.
2. J. Blömer, A. May "A generalized Wiener attack on RSA", In Practice and Theory in Public Key Cryptography (PKC 2004), Lecture Notes in Computer Science, Springer-Verlag 2947, pp. 1-13, 2004.
3. D. Boneh "Twenty years of attacks on the RSA cryptosystem", Notices of the American Mathematical Society (AMS) 46 (2). pp. 203-213, 1999.
4. 0.292", IEEE Trans. on Information Theory, Vol. 46(4), pp. 1339-1349, 2000.
5. D. Boneh, H. Snacham "Fast Variants of RSA", CryptoBytes Vol. 5, No. 1, pp. 1-9, 2002.
6. D. Coppersmith "Small solutions to polynomial equations and low exponent vulnerabilities", Journal of Cryptology, Vol. 10(4), pp. 223-260, 1997.
7. A. Dujella "Continued fractions and RSA with small secret exponent" Tatra Mt. Math. Publ, 29, pp. 101-112, 2004.
8. G. Durfee, P. Nguyen "Cryptanalysis of the RSA Schemes with Short Secret Exponent from Asiacrypt 99", Advances in Cryptology Asiacrypt 2000, Lecture Notes in Computer Science, Springer-Verlag 1976, pp. 14-29, 2000.
9. A. K. Lenstra, H. W. Lenstra, and L. Lovasz "Factoring polynomials with rational coefficients", Mathematische Annalen, Vol. 261, pp. 513-534, 1982.
10. s" in Advances in Cryptography - Proceedings of Indocrypt 1998, Lecture Notes in Computer Science series, Springer-Verlag 1977, pp. 283-294, 2000.
11. A. May "New RSA Vulnerabilities using Lattics Reduction Methods" Ph.D. Dissertation. University of Paderborn. 2003.
12. A. Nitaj "Cryptanalysis of RSA with constrained keys", Appl. Algebra Eng. Commun. Comput., Submitted.
13. A. Nitaj "RSA and a higher degree diophantine equation", Appl. Math. Comput., Submitted.
14. A. Nitaj "Application of ECM to a Class of RSA keys", submitted.
15. R. Rivest, A. Shamir, L. Adleman "A method for obtaining digital signatures and public-key cryptosystems", Communication of ACM 21, pp. 120-126, 1978.
16. K. H. Rosen "Elementary Number Theory" Addison-Wesley, Reading Mass, 1984.
17. V. Shoup "NTL: A Library for doing Number Theory", online available at http:// www.shoup.net/ntl/index.html.
18. R. Steinfeld, S. Contini, J. Pieprzyk, H. Wang "Converse Results to the Wiener Attack on RSA" Lecture Notes in Computer Science, Springer-Verlag 3386, pp. 184-198, 2005.
19. kq" Advances in Cryptography - Proceedings of CRYPTO 1998, Lecture Notes in Computer Science series, Springer-Verlag 1462, pp. 318-326, 1998.
20. E. R. Verheul, H. C. A. van Tilborg " Cryptanalysis of 'less short' RSA secret exponents", Appl. Algebra Eng. Commun. Comput. 8 , pp. 425-435, 1997.
21. B. de Weger "Cryptanalysis of RSA with small prime difference", Applicable Algebra in Engineering, Communication and Computing, Vol. 13(1), pp. 17-28, 2002.
22. M. Wiener "Cryptanalysis of short RSA secret exponents", IEEE Transactions on Information Theory, Vol. 36, pp. 553-558, 1990.