Algebraic Attack on the MQQ Public Key Cryptosystem

In this paper, we present an efficient attack on the multivariate Quadratic Quasigroups (MQQ) public key cryptosystem. Our cryptanalysis breaks the MQQ cryptosystem by solving a system of multivariate quadratic polynomial equations using both the MutantXL algorithm and the F4 algorithm. We present the experimental results that show that MQQ systems is broken up to size n equal to 300. Based on these results we show also that MutantXL solves MQQ systems with much less memory than the F4 algorithm implemented in Magma.

[1]  J. Faugère.  A new efficient algorithm for computing Gröbner bases (F4) , 1999 .

[2]  Michael Wiener,et al.  Advances in Cryptology — CRYPTO’ 99 , 1999 .

[3]  Bart Preneel,et al.  A Study of the Security of Unbalanced Oil and Vinegar Signature Schemes , 2005, CT-RSA.

[4]  Jintai Ding,et al.  Zhuang-Zi: A New Algorithm for Solving Multivariate Polynomial Equations over a Finite Field , 2006, IACR Cryptol. ePrint Arch..

[5]  Adi Shamir,et al.  Efficient Algorithms for Solving Overdefined Systems of Multivariate Polynomial Equations , 2000, EUROCRYPT.

[6]  Ueli Maurer,et al.  Advances in Cryptology — EUROCRYPT ’96 , 2001, Lecture Notes in Computer Science.

[7]  Louis Goubin,et al.  Unbalanced Oil and Vinegar Signature Schemes , 1999, EUROCRYPT.

[8]  Jacques Patarin,et al.  Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms , 1996, EUROCRYPT.

[9]  Niklaus Wirth,et al.  Advances in Cryptology — EUROCRYPT ’88 , 2000, Lecture Notes in Computer Science.

[10]  Jacques Patarin.  Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'98 , 2000, Des. Codes Cryptogr..

[11]  Alfred Menezes,et al.  Topics in Cryptology – CT-RSA 2005 , 2005 .

[12]  Danilo Gligoroski,et al.  A Public Key Block Cipher Based on Multivariate Quadratic Quasigroups , 2008, IACR Cryptol. ePrint Arch..

[13]  Hideki Imai,et al.  Public Quadratic Polynominal-Tuples for Efficient Signature-Verification and Message-Encryption , 1988, EUROCRYPT.

[14]  Bart Preneel,et al.  Advances in cryptology - EUROCRYPT 2000 : International Conference on the Theory and Application of Cryptographic Techniques, Bruges, Belgium, May 14-18, 2000 : proceedings , 2000 .

[15]  Gregory V. Bard,et al.  Accelerating Cryptanalysis with the Method of Four Russians , 2006, IACR Cryptol. ePrint Arch..

[16]  Serge Vaudenay.  Public Key Cryptography - PKC 2005, 8th International Workshop on Theory and Practice in Public Key Cryptography, Les Diablerets, Switzerland, January 23-26, 2005, Proceedings , 2005, Public Key Cryptography.

[17]  Jintai Ding,et al.  MXL2: Solving Polynomial Equations over GF(2) Using an Improved Mutant Strategy , 2008, PQCrypto.

[18]  Bart Preneel,et al.  Large Superfluous Keys in Multivariate Quadratic Asymmetric Systems , 2005, Public Key Cryptography.

[19]  Danilo Gligoroski.  Candidate One-Way Functions and One-Way Permutations Based on Quasigroup String Transformations , 2005, IACR Cryptol. ePrint Arch..

[20]  Danilo Gligoroski,et al.  Multivariate quadratic trapdoor functions based on multivariate quadratic quasigroups , 2008 .

[21]  Jacques Stern,et al.  Advances in Cryptology — EUROCRYPT ’99 , 1999, Lecture Notes in Computer Science.

[22]  Antoine Joux,et al.  Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases , 2003, CRYPTO.

[23]  Jacques Patarin,et al.  Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88 , 1995, CRYPTO.

[24]  Bart Preneel,et al.  Superfluous Keys in Multivariate Quadratic Asymmetric Systems , 2004, IACR Cryptol. ePrint Arch..