A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes

Y. Desmedt, A. M. Odlyzko

Research output: Chapter in Book/Report/Conference proceedingConference contribution

30 Scopus citations

Abstract

A new attack on the RSA cryptosystem is presented. This attack assumes less than previous chosen ciphertext attacks, since the cryptanalyst has to obtain the plaintext versions of some carefully chosen ciphertexts only once, and can then proceed to decrypt further ciphertexts without further recourse to the authorized user’s decrypting facility. This attack is considerably more efficient than the best algorithms that are known for factoring the public modulus. The same idea can also be used to develop an attack on the three-pass system of transmitting information using exponentiation in a finite field.

Original languageEnglish (US)
Title of host publicationAdvances in Cryptology — CRYPTO 1985 - Proceedings
EditorsHugh C. Williams
PublisherSpringer Verlag
Pages516-522
Number of pages7
ISBN (Print)9783540164630
DOIs
StatePublished - 1986
Externally publishedYes
Event5th Annual International Cryptology Conference, CRYPTO 1985 - Santa Barbara, United States
Duration: Aug 18 1985Aug 22 1985

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume218 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other5th Annual International Cryptology Conference, CRYPTO 1985
CountryUnited States
CitySanta Barbara
Period8/18/858/22/85

Fingerprint Dive into the research topics of 'A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes'. Together they form a unique fingerprint.

Cite this