New Attacks on PKCS#1 v1.5 Encryption

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

Volumn 1807, Issue , 2000, Pages 369-381

  Coron, Jean Sébastien ^a,b   Joye, Marc ^b   Naccache, David ^b   Paillier, Pascal ^b  

^a ECOLE NORMALE SUPÉRIEURE   (France)

^b GEMPLUS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

CHOSEN-PLAINTEXT ATTACK; CIPHERTEXTS; ENCRYPTION STANDARDS; PLAINTEXT;

CRYPTOGRAPHY;

EID: 84948949475     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45539-6_25     Document Type: Conference Paper

References (15)

1. M. Bellare and P. Rogaway, Optimal Asymmetric Encryption, Advances in Cryptology - Eurocrypt ’94, vol. 950 of Lecture Notes in Computer Science, pp. 92-111, Springer-Verlag, 1994.
2. D. Bleichenbacher, Chosen ciphertext attacks against protocols based on the RSA encryption standard PKCS#1, Advances in Cryptology – CRYPTO ’98, vol. 1462 of Lecture Notes in Computer Science, pp. 1-12, Springer-Verlag, 1998.
3. D. Boneh, Personal communication.
4. R. Brent, An improved Monte Carlo factorization algorithm, Nordisk Tidskrift för Informationsbehandling (BIT) vol. 20, pp. 176-184, 1980.
5. D. Coppersmith, Finding a small root of a univariate modular equation, Advances in Cryptology — EUROCRYPT ’96, vol. 1070 of Lecture Notes in Computer Science, pp. 155-165, Springer-Verlag, 1996.
6. D. Coppersmith, Small solutions to polynomial equations, and low exponent RSA vulnerabilities, J. of CRYPTOLOGY, 10(4), pp. 233-260, 1997.
7. D. Coppersmith, M. Franklin, J. Patarin and M. Reiter, Low exponent RSA with related messages, Advances in Cryptology — EUROCRYPT ’96, vol. 1070 of Lecture Notes in Computer Science, pp. 1-9, Springer-Verlag, 1996.
8. Y. Desmedt and A. Odlyzko. A chosen text attack on the RSA cryptosystem and some discrete logarithm schemes, Advances in Cryptology — CRYPTO ’85, vol. 218 of Lecture Notes in Computer Science, pp. 516-522, Springer-Verlag, 1986.
9. K. Dickman, On the frequency of numbers containing prime factors of a certain relative magnitude, Arkiv för matematik, astronomi och fysik, vol. 22A, no. 10, pp. 1-14, 1930.
10. G.H. Hardy and E.M. Wright, An Introduction to the theory of numbers, Fifth edition, Oxford University Press, 1979.
11. H. Lenstra, Factoring integers with elliptic curves, Annals of mathematics 126, 1987.
12. Multiprecision Integer and Rational Arithmetic C/C++ Library (MIRACL), available at ftp://ftp.compapp.dcu.ie/pub/crypto/miracl.zip.
13. R. Rivest, A. Shamir and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol. 21-2, pp. 120-126, 1978.
14. RSA Data Security, PKCS #1: RSA Encryption Standard, Nov. 1993. Version 1.5.
15. RSA Laboratories, PKCS #1: RSA Cryptography Specifications, Sep. 1998, version 2.0.