Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88

  • Jacques Patarin
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 963)


In [1] Matsumoto and Imai have developed a new public key scheme for enciphering or signing. (This scheme is completely different and should not be mistaken with another scheme of Matsumoto and Imai developed in 1983 and broken at Eurocrypt’84).

No attacks have been published as yet for this scheme. However we will see in this paper that for almost all the keys almost each cleartext can be found from his ciphertext after only about m 2 n 4 log n computations where m is the degree of the field K chosen, and where mn is the number of bits of the text.

Moreover for absolutely all the keys that give a practical size for the messages it will be possible to find almost all the cleartexts from the corresponding ciphertexts after a feasible computation.

So the algorithm of [1] is insecure.


  1. [1]
    T. Matsumoto and H. Imai, Public Quadratic Polynomial-tuples for efficient signature-verification and message-encryption, EUROCRYP’88, Springer-Verlag 1988, pp. 419–453.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Jacques Patarin
    • 1
  1. 1.CP8 TRANSACLouveciennes CedexFrance

Personalised recommendations