A multiplicative attack using LLL algorithm on RSA signatures with redundancy

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

Volumn 1294, Issue , 1997, Pages 221-234

  Misarsky, Jean Francois ^a  

^a Centre National d'Etudes des Té1écommunications   (France)

Author keywords

LLL algorithm; Multiplicative attack; Redundancy; RSA

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY;

LATTICE BASIS REDUCTION; LLL ALGORITHM; MODULAR REDUNDANCY; MULTIPLICATIVE ATTACK; RSA SIGNATURE SCHEMES; RSA SIGNATURES;

REDUNDANCY;

EID: 21744441311     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/BFb0052238     Document Type: Conference Paper

References (15)

1. L. Babai, "On Lovasz' lattice reduction and the nearest lattice point problem", Combinatorica 6, pp. 1-14.
2. Don Coppersmith, "Finding a Small Root of Univariate Modular Equation", Proceedings of Eurocrypt '96, Lecture Note in Computer Science, vol. 1070, pp. 155-165.
3. W. De Jonge, D. Chaum, "Attacks on some RSA Signatures", Advancesin Cryptology, Crypto '85 Proceedings, Lecture Notes In Computer Science, vol. 218, Springer-Verlag, Berlin, 1986, pp. 18-27.
4. L.C. Guillou, J.J. Quisquater, P. Landrock, C. Shaer, "Precautions taken against various potential attacks in ISO/IEC DIS 9796, Digital signature scheme giving message recovery", Eurocrypt '90 Proceedings, Lecture Notes in Computer Science, vol.473, Springer-Verlag, pp 465-473.
5. M. Girault, J.F. Misarsky, "Selective Forgery of RSA Signatures Using Redundancy", Advances in Cryptology - Eurocrypt '97, Lecture Notes in Computer Science, vol. 1233, Springer-Verlag, pp 495-507.
6. J. Hastad, "Solving simultaneous modular equations of low degree",SIAM J. Comput. vol.17, No.2, April 1988.
7. ISO/IEC 9796, December 1991, "Digital signature scheme giving message recovery".
8. ISO/IEC 9796-3, Working Draft, December 1996, "Digital signature schemes giving message recovery; Part 3: Mechanisms using a check-function".
9. A. K. Lenstra, H. W. Lenstra, L. Lovasz, "Factoring Polynomials with Rational Coefficients", Mathematische Annalen, vol.261, n. 4, 1982, pp. 515-534.
10. T. Okamoto and A. Shiraishi, "A fast signature scheme based on quadratic inequalities", Proc. of the 1985 Sympsium on Security and Privacy, Apr. 1985, Oakland, CA.
11. A.J. Menezes, P.C. Van Oorschot, S.A. Vanstone, "Handbook of Applied Cryptography", CRC Press.
12. R.L. Rivest, A. Shamir and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystems", CACM, Vol. 21, n 2, Feb. 1978, pp. 120-126.
13. Shamir, "A polynomial-time algorithm for breaking the basic Merkle-Hellman cryptosystem", Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, pp 145-152. IEEE, 1982.
14. B. Vallee, M. Girault, P. Toffin, "How to break Okamoto's cryptosystems by reducing lattice bases", Proceedings of Eurocrypt'87, Lecture notes in Computer Science.
15. B. Vallee, M. Girault, P. Toffin, "How to guess L-th roots modulo n by reducing lattice bases", Proc. of Conference of ISSAC-88 and AAECC-6, Jul. 88.