Cryptanalysis of 'less short' RSA secret exponents

Applicable Algebra in Engineering, Communications and Computing

Volumn 8, Issue 5, 1997, Pages 425-435

  Verheul, Eric R ^a   Van Tilborg, Henk C A ^b  

^a Department of the Interior ^*  (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Continued fractions; Cryptanalysis; RSA system

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; MATHEMATICAL MODELS;

CONTINUED FRACTIONS (CF); CRYPTANALYSIS; CRYPTOSYSTEMS; SECRET EXPONENTS; WIENER'S METHOD;

CRYPTOGRAPHY;

EID: 0030662908     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002000050082     Document Type: Article

References (6)

1. Davenport. H.: The higher arithmetic, 5th edn. Cambridge: Cambridge University Press 1981
2. Koyama, K.: Direct demonstration of the power to break public-key cryptosystems. In: Seberry, J., Pieprzyk, J. (eds.) Advances in cryptology - AUSCRYPT'90. Lecture Notes in Computer Science, Vol. 453, pp. 14-21. Berlin Heidelberg New York: Springer 1990
3. Knuth, D.: The art of computer programming, Vol. 2. Seminumerical algorithms. 2nd edn, New York: Addison-Wesley 1981
4. Perron, O.: Die Lehre von den Kettenbruchen, 3rd edn, 2 vols. Stuttgart: Teubner 1954
5. Rivest, R. L., Shamir, A., Adleman, L.: A method for obtaining digital and public key cryptosystems. Commun. ACM 21 (2), 158-164 (1978)
6. Wiener, M. J.: Cryptanalysis of short RSA secret exponents, IEEE Trans. Inform. Theory IT-36, 553-558 (1990)