Multivariate cryptography

Short description: Field of asymmetric cryptographic primitives

Multivariate cryptography is the generic term for asymmetric cryptographic primitives based on multivariate polynomials over a finite field F. In certain cases, those polynomials could be defined over both a ground and an extension field. If the polynomials have degree two, we talk about multivariate quadratics. Solving systems of multivariate polynomial equations is proven to be NP-complete.[1] Those schemes are often considered to be good candidates for post-quantum cryptography. Multivariate cryptography has been very productive in terms of design and cryptanalysis. Overall, the situation is now more stable and the strongest schemes have withstood the test of time. It is commonly admitted that Multivariate cryptography turned out to be more successful as an approach to build signature schemes primarily because multivariate schemes provide the shortest signature among post-quantum algorithms.

## Contents

* 1 History
* 2 Construction
* 3 Signature
* 4 Applications
* 5 References
* 6 External links

## History

Tsutomu Matsumoto and Hideki Imai (1988) presented their so-called C* scheme at the Eurocrypt conference. Although C* has been broken by Jacques Patarin (1995), the general principle of Matsumoto and Imai has inspired a generation of improved proposals. In later work, the "Hidden Monomial Cryptosystems" was developed by Script error: The function "in_lang" does not exist. Jacques Patarin. It is based on a ground and an extension field. "Hidden Field Equations" (HFE), developed by Patarin in 1996, remains a popular multivariate scheme today [P96]. The security of HFE has been thoroughly investigated, beginning with a direct Gröbner basis attack [FJ03, GJS06], key-recovery attacks (Kipnis Shamir) [BFP13], and more. The plain version of HFE is considered to be practically broken, in the sense that secure parameters lead to an impractical scheme. However, some simple variants of HFE, such as the minus variant and the vinegar variant allow one to strengthen the basic HFE against all known attacks.

In addition to HFE, Patarin developed other schemes. In 1997 he presented “Balanced Oil & Vinegar” and in 1999 “Unbalanced Oil and Vinegar”, in cooperation with Aviad Kipnis and Louis Goubin (Kipnis Patarin). Four multivariate cryptography signature schemes (GeMMS, LUOV, Rainbow and MQDSS) made their way into the 2nd round of the NIST post-quantum competition: see slide 12 of the report.[2] The Rainbow scheme advanced to round 3 until it was broken in 2022,[3] and none of the others were left by round 4.[4]

## Construction

Multivariate Quadratics involves a public and a private key. The private key consists of two affine transformations, S and T, and an easy to invert quadratic map P′:Fm->Fn. We denote the n×n matrix of the affine endomorphisms S:Fn->Fn by MS and the shift vector by vS∈Fn and similarly for T:Fm->Fm. In other words,

* S(x)=MSx+vS and
* T(y)=MTy+vT.

The triple (S−1,P′−1,T−1) is the private key, also known as the trapdoor. The public key is the composition P=S∘P′∘T which is by assumption hard to invert without the knowledge of the trapdoor.

## Signature

Signatures are generated using the private key and are verified using the public key as follows. The message is hashed to a vector in y∈Fn via a known hash function. The signature is

x=P−1(y)=T−1(P′−1(S−1(y))).

The receiver of the signed document must have the public key P in possession. He computes the hash y and checks that the signature x fulfils P(x)=y.

## Applications

* Unbalanced Oil and Vinegar
* Hidden Field Equations
* SFLASH by NESSIE
* Rainbow
* TTS
* QUARTZ
* QUAD (cipher)

## References

1. ↑ Garey, Michael R. (1979). Computers and intractability : a guide to the theory of NP-completeness. Johnson, David S., 1945-. San Francisco: W.H. Freeman. ISBN 0-7167-1044-7. OCLC 4195125.
2. ↑ Moody, Dustin (22 August 2019). "The 2nd Round of the NIST PQC Standardization Process". NIST. https://csrc.nist.gov/Presentations/2019/the-2nd-round-of-the-nist-pqc-standardization-proc. Retrieved 11 October 2020.
3. ↑ Goodin, Dan (2 August 2022). "Post-quantum encryption contender is taken out by single-core PC and 1 hour" (in en). Ars Technica. https://arstechnica.com/information-technology/2022/08/sike-once-a-post-quantum-encryption-contender-is-koed-in-nist-smackdown/.
4. ↑ Computer Security Division, Information Technology Laboratory (3 January 2017). "Round 4 Submissions - Post-Quantum Cryptography | CSRC | CSRC" (in EN-US). https://csrc.nist.gov/projects/post-quantum-cryptography/post-quantum-cryptography-standardization/round-4-submissions.

* [BFP13] L. Bettale, Jean-Charles Faugère, and L. Perret, Cryptanalysis of HFE, Multi-HFE and Variants for Odd and Even Characteristic. DCC'13
* [FJ03] Jean-Charles Faugère and A. Joux, Algebraic Cryptanalysis of Hidden Field Equation (HFE) Cryptosystems Using Gröbner Bases. CRYPTO'03
* [GJS06] L. Granboulan, Antoine Joux, J. Stern: Inverting HFE Is Quasipolynomial. CRYPTO'06.
* Kipnis, Aviad; Shamir, Adi (1999). "Cryptanalysis of the HFE Public Key Cryptosystem by Relinearization". Advances in Cryptology – CRYPTO' 99. Berlin, Heidelberg: Springer. doi:10.1007/3-540-48405-1_2. ISBN 978-3-540-66347-8.
* Kipnis, Aviad; Patarin, Jacques; Goubin, Louis (1999). "Advances in Cryptology – CRYPTO' 99". in Jacques Stern. Eurocrypt'99. Springer. doi:10.1007/3-540-48910-x_15. ISBN 3-540-65889-0.
* Matsumoto, Tsutomu; Imai, Hideki (1988). "Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption". Lecture Notes in Computer Science. Berlin, Heidelberg: Springer. doi:10.1007/3-540-45961-8_39. ISBN 978-3-540-50251-7.
* Patarin, Jacques (1995). "Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88". Advances in Cryptology – CRYPT0' 95. Lecture Notes in Computer Science. 963. Berlin, Heidelberg: Springer. pp. 248–261. doi:10.1007/3-540-44750-4_20. ISBN 978-3-540-60221-7.
* [P96] Jacques Patarin, Hidden Field Equations (HFE) and Isomorphisms of Polynomials (IP): two new Families of Asymmetric Algorithms (extended version); Eurocrypt '96
* Christopher Wolf and Bart Preneel, Taxonomy of Public Key Schemes based on the problem of Multivariate Quadratic equations; Current Version: 2005-12-15
* An Braeken, Christopher Wolf, and Bart Preneel, A Study of the Security of Unbalanced Oil and Vinegar Signature Schemes, Current Version: 2005-08-06
* Jintai Ding, Research Project: Cryptanalysis on Rainbow and TTS multivariate public key signature scheme
* Jacques Patarin, Nicolas Courtois, Louis Goubin, SFLASH, a fast asymmetric signature scheme for low-cost smartcards. Primitive specification and supporting documentation.
* Bo-Yin Yang, Chen-Mou Cheng, Bor-Rong Chen, and Jiun-Ming Chen, Implementing Minimized Multivariate PKC on Low-Resource Embedded Systems, 2006
* Bo-Yin Yang, Jiun-Ming Chen, and Yen-Hung Chen, TTS: High-Speed Signatures on a Low-Cost Smart Card, 2004
* Nicolas T. Courtois, Short Signatures, Provable Security, Generic Attacks and Computational Security of Multivariate Polynomial Schemes such as HFE, Quartz and Sflash, 2005
* Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone, Handbook of Applied Cryptography, 1997

## External links

* [1] The HFE public key encryption and signature
* [2] HFEBoost

* v
* t
* e

Cryptography

* History of cryptography
* Cryptanalysis
* Outline of cryptography

* Symmetric-key algorithm
* Block cipher
* Stream cipher
* Public-key cryptography
* Cryptographic hash function
* Message authentication code
* Random numbers
* Steganography

* Category

0.00

(0 votes)

Original source: https://en.wikipedia.org/wiki/Multivariate cryptography. Read more

|

Retrieved from "https://handwiki.org/wiki/index.php?title=Multivariate_cryptography&oldid=4296762"
*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template