Abstract
The Matsumoto-Imai public key scheme was developed to provide very fast signatures. It is based on substitution polynomials over GF(2m). This paper shows in two ways that the Matsumoto-Imai public key scheme is very easy to break. In the faster of the two attacks the time to cryptanalyze the scheme is about proportional to the binary length of the public key. This shows that Matsumoto and Imai greatly overestimated the security of their scheme.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
R. Carmichael, Introduction to the Theory of Groups of Finite Order, Dover, New York, 1956.
E. R. Berlekamp, Algebraic Coding Theory, McGraw-Hill, 1968.
D. W. Kravitz and I. S. Reed, Extension of RSA Crypto-Structure: A Galois Approach, Electronics Letters, vol. 18, no 6, pp. 255–256, 18th March 1982.
P. Delsarte and P. Piret, Comment: Extension of RSA Crypto-Structure: A Galois Approach, Electronics Letters, vol. 18, no. 13, pp. 582–583, 24th June 1982.
K. Yiu and K. Peterson, A Single-Chip VLSI Implementation of the Discrete Exponential Public Key Distribution System, Proc. Globecom’ 82 IEEE Global Telecommunications Conference, vol. 1, pp. 173–179, Miami, USA, 1982.
D. Coppersmith, Fast Evaluation of Logarithms in Fields of Characteristic Two, Research Report, RC 10187 IBM Yorktown Heights. IEEE Trans. Inform. Theory, to appear.
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.
D. E. Knuth, The Art of Computer Programming, Vol. 2, Seminumerical Algorithms, Addison-Wesley, Reading, Massachusetts, 1981.
D. E. Knuth, The Art of Computer Programming, Vol. 3, Sorting and Searching, Addison-Wesley, Reading, Massachusetts 1975.
J. Gait, Short Cycling in the Kravitz-Reed Public Key Encryption System, Electronics Letters, vol. 18, no. 16, pp. 706–707, 5th August 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1985 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Delsarte, P., Desmedt, Y., Odlyzko, A., Piret, P. (1985). Fast Cryptanalysis of the Matsumoto-Imai Public Key Scheme. In: Beth, T., Cot, N., Ingemarsson, I. (eds) Advances in Cryptology. EUROCRYPT 1984. Lecture Notes in Computer Science, vol 209. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-39757-4_14
Download citation
DOI: https://doi.org/10.1007/3-540-39757-4_14
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16076-2
Online ISBN: 978-3-540-39757-1
eBook Packages: Springer Book Archive