Skip to main content
Conference ProceedingsOPEN ACCESS

Fast cryptanalysis of the Matsumoto-Imai public key scheme

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1985) 209 LNCS 142-149
DOI: 10.1007/3-540-39757-4_14
6Citations
Citations of this article
35Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Delsarte, P., Desmedt, Y., Odlyzko, A., & Piret, P. (1985). Fast cryptanalysis of the Matsumoto-Imai public key scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 209 LNCS, pp. 142–149). Springer Verlag. https://doi.org/10.1007/3-540-39757-4_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free