Computational cryptography › Multivariate
Hardness assumptionHistorically broken

Matsumoto-Imai trapdoor stays hidden

In plain words

The bet that early multivariate schemes hid their shortcut. Attackers found hidden patterns and inverted them without the key.

The idea: These schemes take a map that's easy to invert, like raising to a fixed power in a large field, and hide it between two secret linear scrambles. Patarin noticed that for C* every input and output satisfy simple equations, which anyone can learn from enough examples and then use to invert the map without the scrambles.

Why it matters: It took down SFLASH, a scheme a European standards project had recommended.

The details

On the map: ✗ C* broken 1995 (Patarin), its "minus" variant SFLASH, 2007

Matsumoto and Imai's 1988 scheme C*[1] was one of the first multivariate public-key schemes: an easily inverted map over a large field, disguised by secret linear changes of variables. In 1995 Patarin found[2] simple equations linking inputs and outputs that let anyone invert it without the key.

"Minus" variants, which hide some of the outputs, were meant to block that attack. SFLASH used one. In 2007 Dubois, Fouque, Shamir and Stern[3] found a hidden symmetry that let them rebuild the missing outputs, after which Patarin's attack applied again. HFE, a related trapdoor, has also been badly weakened by algebraic attacks[4].

Rests on

If any of these breaks, this breaks too.

If it falls

If this breaks, these break with it.

References

  1. Tsutomu Matsumoto and Hideki Imai. Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption. Advances in Cryptology — EUROCRYPT ’88, 1988. doi:10.1007/3-540-45961-8_39
  2. Jacques Patarin. Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88. Advances in Cryptology — CRYPT0’ 95, 1995. doi:10.1007/3-540-44750-4_20
  3. Vivien Dubois, Pierre-Alain Fouque, Adi Shamir and Jacques Stern. Practical Cryptanalysis of SFLASH. Advances in Cryptology - CRYPTO 2007. doi:10.1007/978-3-540-74143-5_1
  4. Jean-Charles Faugère and Antoine Joux. Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases. Advances in Cryptology - CRYPTO 2003. doi:10.1007/978-3-540-45146-4_3