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

Y. Desmedt; A. M. Odlyzko

doi:10.1007/3-540-39799-X_40

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 proceeding › Conference contribution

34 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 language	English (US)
Title of host publication	Advances in Cryptology — CRYPTO 1985 - Proceedings
Editors	Hugh C. Williams
Publisher	Springer Verlag
Pages	516-522
Number of pages	7
ISBN (Print)	9783540164630
DOIs	https://doi.org/10.1007/3-540-39799-X_40
State	Published - 1986
Externally published	Yes
Event	5th Annual International Cryptology Conference, CRYPTO 1985 - Santa Barbara, United States Duration: Aug 18 1985 → Aug 22 1985

Publication series

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

Other

Other	5th Annual International Cryptology Conference, CRYPTO 1985
Country/Territory	United States
City	Santa Barbara
Period	8/18/85 → 8/22/85

Bibliographical note

Publisher Copyright:
© 1986, Springer-Verlag Berlin Heidelberg.

Access

10.1007/3-540-39799-X_40

OpenUrl availability

Full text

Cite this

Desmedt, Y., & Odlyzko, A. M. (1986). A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes. In H. C. Williams (Ed.), Advances in Cryptology — CRYPTO 1985 - Proceedings (pp. 516-522). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 218 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-39799-X_40

A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes. / Desmedt, Y.; Odlyzko, A. M.
Advances in Cryptology — CRYPTO 1985 - Proceedings. ed. / Hugh C. Williams. Springer Verlag, 1986. p. 516-522 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 218 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Desmedt, Y & Odlyzko, AM 1986, A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes. in HC Williams (ed.), Advances in Cryptology — CRYPTO 1985 - Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 218 LNCS, Springer Verlag, pp. 516-522, 5th Annual International Cryptology Conference, CRYPTO 1985, Santa Barbara, United States, 8/18/85. https://doi.org/10.1007/3-540-39799-X_40

Desmedt Y, Odlyzko AM. A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes. In Williams HC, editor, Advances in Cryptology — CRYPTO 1985 - Proceedings. Springer Verlag. 1986. p. 516-522. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-39799-X_40

@inproceedings{a1162a2cbc6c4fc9911bdbf2e879ae14,

title = "A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes",

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{\textquoteright}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.",

author = "Y. Desmedt and Odlyzko, {A. M.}",

note = "Publisher Copyright: {\textcopyright} 1986, Springer-Verlag Berlin Heidelberg.; 5th Annual International Cryptology Conference, CRYPTO 1985 ; Conference date: 18-08-1985 Through 22-08-1985",

year = "1986",

doi = "10.1007/3-540-39799-X_40",

language = "English (US)",

isbn = "9783540164630",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "516--522",

editor = "Williams, {Hugh C.}",

booktitle = "Advances in Cryptology — CRYPTO 1985 - Proceedings",

}

TY - GEN

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

AU - Desmedt, Y.

AU - Odlyzko, A. M.

PY - 1986

Y1 - 1986

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85030458019&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85030458019&partnerID=8YFLogxK

U2 - 10.1007/3-540-39799-X_40

DO - 10.1007/3-540-39799-X_40

M3 - Conference contribution

AN - SCOPUS:85030458019

SN - 9783540164630

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

SP - 516

EP - 522

BT - Advances in Cryptology — CRYPTO 1985 - Proceedings

A2 - Williams, Hugh C.

PB - Springer Verlag

T2 - 5th Annual International Cryptology Conference, CRYPTO 1985

Y2 - 18 August 1985 through 22 August 1985

ER -

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

Abstract

Publication series

Other

Bibliographical note

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this