The regular multivariate quadratic problem
From MaRDI portal
Cites work
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head
- A new algebraic approach to the regular syndrome decoding problem and implications for PCG constructions
- A new efficient algorithm for computing Gröbner bases (F₄)
- An inequality for Hilbert series of graded algebras.
- Analytic combinatorics
- Asymptotic approximations of integrals
- Beating brute force for systems of polynomial equations over finite fields
- Bruno Buchberger's PhD thesis 1965: An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal. Translation from the German
- Complexity of problems in games, graphs and algebraic equations
- 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
- Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\)
- Faster signatures from MPC-in-the-head
- scientific article; zbMATH DE number 1676636 (Why is no real title available?)
- scientific article; zbMATH DE number 3857249 (Why is no real title available?)
- scientific article; zbMATH DE number 578220 (Why is no real title available?)
- scientific article; zbMATH DE number 2151220 (Why is no real title available?)
- scientific article; zbMATH DE number 7788489 (Why is no real title available?)
- Hybrid approach for solving multivariate systems over finite fields
- Ideals, Varieties, and Algorithms
- Lower bounds on the size of bounded depth circuits over a complete basis with logical addition
- Not just regular decoding: asymptotics and improvements of regular syndrome decoding attacks
- On the complexity of solving quadratic Boolean systems
- On the inherent intractability of certain coding problems (Corresp.)
- Practical complexities of probabilistic algorithms for solving Boolean polynomial systems
- Progress in Cryptology – Mycrypt 2005
- Short signatures from regular syndrome decoding in the head
- Solving degree, last fall degree, and related invariants
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- Solving quadratic equations with XL on parallel architectures
- Solving sparse linear equations over finite fields
- Solving systems of polynomial equations over GF(2) by a parity-counting self-reduction
- Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
- The polynomial method in circuit complexity applied to algorithm design (invited talk)
- TinyKeys: a new approach to efficient multi-party computation
This page was built for publication: The regular multivariate quadratic problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891601)
