Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'98

Designs, Codes, and Cryptography

Volumn 20, Issue 2, 2000, Pages 175-209

  Patarin, Jacques ^a  

^a Bull SC and T   (France)

Author keywords

Candidate trapdoor permutation; Cryptanalysis; Exponentiation over a finite field; Multivariate polynomials; Public key encryption; Public key signatures

Indexed keywords

EID: 0346111821     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1008341625464     Document Type: Article

References (12)

1. A. Aho, J. Hopcroft, and J. Ullman, The Design and Analysis of Computer Algorithms, Addison Wesley.
2. G. Brassard, A note on the complexity of cryptography, IEEE Tran. Inform. Theory, Vol. IT-25 (1979) pp. 232-233.
3. E. Brickell and A. Odlyzko, Cryptanalysis, A survey of recent results, Contemporary Cryptology (Gustavus J. Simmons, ed.), (1992) p. 506.
4. D. Coppersmith and S. Winograd, Matrix multiplication via arithmetic progressions, J. Symbolic Computation, Vol. 9 (1990) pp. 251-280.
5. M. Garey and D. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completness, Freeman and Company.
6. R. Lidl and H. Niederreiter, Finite fields, Encyclopedia of Mathematics and Its Applications, Cambridge University Press.
7. T. Matsumoto and H. Imai, Public quadratic polynomial-tuples for efficient signature-verification and message-encryption, EUROCRYPT'88, Springer-Verlag (1988) pp. 419-453.
8. J. Patarin, L. Goubin, Asymmetric cryptography with S-boxes, ICICS'97, LNCS, Springer-Verlag, 1334, pp. 369-380.
9. A. Shamir, An efficient identification scheme based on permuted kernels, CRYPTO'89, pp. 606-609.
10. J. Stern, A new identification scheme based on syndrome decoding, CRYPTO'93, pp. 13-21. Another Algorithm Previously T. Matsumoto and H. Imai have suggested another algorithm, completely different, which was broken in 1984. The knowledge of this other algorithm is not needed, but we give here its references and the reference of its attack in order to avoid confusion between the two algorithms of Matsumoto and Imai.
11. T. Matsumoto and H. Imai, A class of asymmetric crypto-systems based on polynomials over finite rings, IEEE Intern. Symp. Inform. Theory, St Jovite, Quebec, Canada, September 26-30, 1983, Abstracts of Papers, pp. 131-132.
12. P. Delsarte, Y. Desmedt, A. Odlyzko, and P. Piret, Fast cryptanalysis of the Matsumoto-Imai public key scheme, EUROCRYPT'84, pp. 142-149.