Y. Desmedt, A. M. Odlyzko  Home/Search
Context Related
| belllabs.com/netlib/at...rsa.attack.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: belllabs.com/netlib/a...complete (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
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... (Update)
Cited by: More
New Attacks on PKCS#1 v1.5 Encryption - Coron, Joye, al. (2000) (Correct)
Padding Attacks on RSA - David Naccache Gemplus (Correct)
Recent Results on Signature Forgery - Silverman, Naccache (1999) (Correct)
Active bibliography (related documents): More All
0.1: Cryptanalysis of RSA-Type Cryptosystems: A Visit - Joye, Quisquater (1998) (Correct)
0.1: Fast Generation of Prime Numbers and Secure Public-Key.. - Maurer (1994) (Correct)
0.1: Sparse RSA Secret Keys and Their Generation - Lim, Lee (1996) (Correct)
Similar documents based on text: More All
0.3: On Some Attacks On Multi-Prime RSA - Hinek, Low, Teske (2002) (Correct)
0.1: Optimum Traitor Tracing and Asymmetric Schemes - Kurosawa, Desmedt (1998) (Correct)
0.1: On the Difficulty of Software Key Escrow - Knudsen, Pedersen (1996) (Correct)
Related documents from co-citation: More All
30: A method for obtaining digital signatures and public-key cryptosystems; Communic.. - Rivest, Shamir et al. - 1978
21: Chosen Ciphertext Attacks Against Protocols Based on The RSA Encryption Standard.. - Bleichenbacher - 1998
21: Low exponent RSA with related messages - Coppersmith, Franklin et al. - 1996
BibTeX entry: (Update)
Y. Desmedt and A. M. Odlyzko, A chosen text attack on the RSA cryptosystem and some discrete logarithms schemes, Advances in Cryptology -- Crypto '85 (H. C. Williams, ed.), Lecture Notes in Computer Science, vol. 218, Springer-Verlag, 1986, pp. 516--521. http://citeseer.ist.psu.edu/desmedt86chosen.html More
@inproceedings{ desmedt85chosen,
author = "Yvo Desmedt and Andrew M. Odlyzko",
title = "A Chosen Text Attack on the {RSA} Cryptosystem and Some Discrete Logarithm Schemes",
booktitle = "{CRYPTO}",
pages = "516-522",
year = "1985",
url = "citeseer.ist.psu.edu/desmedt86chosen.html" }
Citations (may not include all citations):1529 A method for obtaining digital signatures and publickey cryp.. - Rivest, Shamir et al. - 1978
635 New directions in cryptography - Diffie, Hellman - 1976
47 Discrete logarithms in finite fields and their cryptographic.. - Odlyzko
38 Cryptography: A Primer (context) - Konheim - 1981
37 Analysis and comparison of some integer factoring algorithms (context) - Pomerance - 1982
35 Discrete logarithms in GF (context) - Coppersmith, Odlyzko et al.
26 Digital signatures with RSA and other public-key cryptosyste.. (context) - Denning - 1984
23 On using RSA with low exponent in a public key network (context) - Hastad
18 Remarks on a proposed cryptanalytic attack on the M (context) - Rivest - 1978
16 public-key cryptosystem (context) - Simmons, Norris et al. - 1977
14 of Electrical Engineering and Computer Science (context) - Davida, cryptanalysis et al. - 1982
1 and Computer Security Models (context) - DeMillo, Davida et al. - 1983
1 manuscript in preparation (context) - Lenstra
1 A potential danger with low-exponent modular encryption sche.. (context) - Blum
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://netlib.bell-labs.com/netlib/att/math/people/amo/doc/complete.html): More
Connectedness, Classes, and Cycle Index - Bender, Cameron, Odlyzko, Richmond (Correct)
Short Proofs for Nondivisibility of Sparse Polynomials.. - Grigoriev, Karpinski.. (1996) (Correct)
Lattice Points in High-Dimensional Spheres - Mazo, Odlyzko (1990) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC