An estimator for the hardness of the MQ problem
From MaRDI portal
(Redirected from An estimator for the hardness of the MQ problem)
Recommendations
- Extended algorithm for solving underdefined multivariate quadratic equations
- Multivariable algebra theory and its application in cryptography
- Solving underdetermined systems of multivariate quadratic equations revisited
- A multivariate quadratic challenge toward post-quantum generation cryptography
- scientific article; zbMATH DE number 2085432
Cites work
- A crossbred algorithm for solving Boolean polynomial systems
- A new efficient algorithm for computing Gröbner bases (F₄)
- A survey on signature-based algorithms for computing Gröbner bases
- A survey on the complexity of solving algebraic systems
- An Efficient F₄ -style Based Algorithm to Solve MQ Problems
- Asymptotically faster quantum algorithms to solve multivariate quadratic equations
- Beating brute force for systems of polynomial equations over finite fields
- Comparison Between XL and Gröbner Basis Algorithms
- Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Extended algorithm for solving underdefined multivariate quadratic equations
- Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\)
- Fast exhaustive search for quadratic systems in \(\mathbb {F}_2\) on FPGAs
- Gaussian elimination is not optimal
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 2085432 (Why is no real title available?)
- scientific article; zbMATH DE number 3857249 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Improved cryptanalysis of UOV and Rainbow
- Improving Thomae-Wolf algorithm for solving underdetermined multivariate quadratic polynomial problem
- Information Security and Privacy
- M4GB. An efficient Gröbner-basis algorithm
- On the complexity of solving quadratic Boolean systems
- On the complexity of the \(F_5\) Gröbner basis algorithm
- On the concrete hardness of learning with errors
- Phase Transition of Multivariate Polynomial Systems
- Post-Quantum Cryptography
- Practical complexities of probabilistic algorithms for solving Boolean polynomial systems
- Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials
- Rainbow, a New Multivariable Polynomial Signature Scheme
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- SOFIA: \(\mathcal{MQ}\)-based signatures in the QROM
- Solving binary \(\mathcal {MQ}\) with Grover's algorithm
- Solving polynomial equations. Foundations, algorithms, and applications
- Solving quadratic equations with XL on parallel architectures
- Solving systems of polynomial equations over GF(2) by a parity-counting self-reduction
- Solving underdetermined systems of multivariate quadratic equations revisited
- Syndrome Decoding Estimator
- Unbalanced Oil and Vinegar Signature Schemes
Cited in
(21)- Implementing Joux-Vitse's crossbred algorithm for solving \(\mathcal M\mathcal Q\) systems over \(\mathbb F_2\) on GPUs
- On the complexity of solving quadratic Boolean systems
- Short solutions to nonlinear systems of equations
- On the equivalence of two post-quantum cryptographic families
- Solving underdetermined systems of multivariate quadratic equations revisited
- Multivariable algebra theory and its application in cryptography
- Analysis of QUAD
- Connecting the complexity of MQ- and code-based cryptosystems
- Extended algorithm for solving underdefined multivariate quadratic equations
- A multivariate quadratic challenge toward post-quantum generation cryptography
- A technique to reduce memory usage of M4GB algorithm
- An Efficient F₄ -style Based Algorithm to Solve MQ Problems
- Building MPCitH-based signatures from MQ, MinRank, and rank SD
- Biscuit: new MPCitH signature scheme from structured multivariate polynomials
- Improved attacks for SNOVA by exploiting stability under a group action
- Admissible parameters for the crossbred algorithm and semi-regular sequences over finite fields
- One tree to rule them all: optimizing GGM trees and OWFs for post-quantum signatures
- Polynomial XL: a variant of the XL algorithm using Macaulay matrices over polynomial rings
- Preliminary cryptanalysis of the Biscuit signature scheme
- An analysis of the Crossbred algorithm for the MQ problem
- Security analysis on UOV families with odd characteristics: using symmetric algebra
This page was built for publication: An estimator for the hardness of the MQ problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103087)
