Dimension of the linearization equations of the matsumoto-imai cryptosystems

Authors:
Adama Diene;Jintai Ding;Jason E. Gower;Timothy J. Hodges;Zhijun Yin
Affiliations:
Department of Mathematical Sciences, University of Cincinnati, Cincinnati, OH;Department of Mathematical Sciences, University of Cincinnati, Cincinnati, OH;Department of Mathematical Sciences, University of Cincinnati, Cincinnati, OH;Department of Mathematical Sciences, University of Cincinnati, Cincinnati, OH;Department of Mathematical Sciences, University of Cincinnati, Cincinnati, OH
Venue:
WCC'05 Proceedings of the 2005 international conference on Coding and Cryptography
Year:
2005

Citing 6
Cited 1

Public quadratic polynomial-tuples for efficient signature-verification and message-encryption

Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
FLASH, a Fast Multivariate Signature Algorithm

CT-RSA 2001 Proceedings of the 2001 Conference on Topics in Cryptology: The Cryptographer's Track at RSA
Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization

CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Cryptoanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
A Fast and Secure Implementation of Sflash

PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Hidden fields equations (HFE) and isomorphisms of polynomials (IP): Two new families of asymmetric algorithms

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques

Square, a New Multivariate Encryption Scheme

CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Matsumoto-Imai (MI) cryptosystem was the first multivariate public key cryptosystem proposed for practical use. Though MI is now considered insecure due to Patarin's linearization attack, the core idea of MI has been used to construct many variants such as Sflash, which has recently been accepted for use in the New European Schemes for Signatures, Integrity, and Encryption project. Linearization attacks take advantage of the algebraic structure of MI to produce a set of equations that can be used to recover the plaintext from a given ciphertext. In our paper, we present a solution to the problem of finding the dimension of the space of linearization equations, a measure of how much work the attack will require.