Everything about Multivariate cryptography
Field of asymmetric cryptographic primitives
Multivariate cryptography is the generic term for asymmetric cryptographic primitives based on multivariate polynomials over a finite field. 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. 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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Multivariate cryptographyA 5-minute orientation
- Skim a recent paper: Finite algebras in the design of multivariate cryptography algorithmsInfluential work since 2022
- Pick up a classic book: Multivariate CryptographyThe most-reprinted book on the subject
- Read the landmark paper: Current State of Multivariate CryptographyCited 100 times
- Go sideways: Hidden Field EquationsA closely related topic
- Go sideways: Unbalanced oil and vinegar schemeA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Current State of Multivariate Cryptography
Progress in Multivariate Cryptography: Systematic Review, Challenges, and Research Directions
Recent progress in the security evaluation of multivariate public‐key cryptography
Multivariate Cryptography Based on Clipped Hopfield Neural Network
An efficient algorithm for decomposing multivariate polynomials and its applications to cryptography
A multivariate quadratic challenge toward post-quantum generation cryptography
Revisiting Multivariate Ring Learning with Errors and Its Applications on Lattice-Based Cryptography
A secure and efficient group signature scheme based on multivariate public key cryptography
🆕 Influential since 2022
Finite algebras in the design of multivariate cryptography algorithms
Vector finite fields of characteristic two as algebraic support of multivariate cryptography
On new protocols of Noncommutative Cryptography in terms of homomorphism of stable multivariate transformation groups
Quantum-safe identity-based broadcast encryption with provable security from multivariate cryptography
Linear codes of Schubert cells and implementations of new quadratic public keys of Multivariate Cryptography
📚 Books worth reading
Multivariate Cryptography · 2010
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Hidden Field Equations Hidden Fields Equations (HFE), also known as HFE trapdoor function, is a public key cryptosystem which was introduced at Eurocrypt in 1996 and proposed…
- Unbalanced oil and vinegar scheme In cryptography, the unbalanced oil and vinegar (UOV) scheme is a modified version of the oil and vinegar scheme designed by J. Patarin. Both are digital…
- XSL attack In cryptography, the eXtended Sparse Linearization (XSL) attack is a method of cryptanalysis for block ciphers. The attack was first published in 2002…
- QUAD (cipher) In cryptography, the QUAD cipher is a stream cipher which was designed with provable security arguments in mind. QUAD relies on the iteration of a randomly…
- Ideal lattice In discrete mathematics, ideal lattices are a special class of lattices and a generalization of cyclic lattices. Ideal lattices naturally occur in many…
- Algebraic attack Algebraic attack is a method of algebraic cryptanalysis by which a set of algebraic equations can be used to solve a cryptographic Boolean function that…
- Interpolation attack In cryptography, an interpolation attack is a type of cryptanalytic attack against block ciphers. After the two attacks, differential cryptanalysis and…
- Computational hardness assumption In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where…