Beating brute force for systems of polynomial equations over finite fields

Recommendations

Counting solutions to polynomial systems via reductions
Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
On the complexity exponent of polynomial system solving
On solving sparse algebraic equations over finite fields
Sparse algebraic equations over finite fields

Cited in

(33)

Gate elimination: circuit size lower bounds and \#SAT upper bounds
Solving non-linear Boolean equation systems by variable elimination
Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\)
Practical complexities of probabilistic algorithms for solving Boolean polynomial systems
The inverse of \(\chi\) and its applications to Rasta-like ciphers
CNF satisfiability in a subspace and related problems
Preimage attacks on 4-round Keccak by solving multivariate quadratic systems
On the complexity exponent of polynomial system solving
On the complexity of finding tensor ranks
MaxMinMax problem and sparse equations over finite fields
On solving systems of diagonal polynomial equations over finite fields
Deterministically counting satisfying assignments for constant-depth circuits with parity gates, with implications for lower bounds
Solving systems of diagonal polynomial equations over finite fields
Classical algorithms from quantum and Arthur-Merlin communication protocols
Solving systems of polynomial equations over GF(2) by a parity-counting self-reduction
scientific article; zbMATH DE number 7250146 (Why is no real title available?)
Counting solutions to polynomial systems via reductions
Efficient Construction of Rigid Matrices Using an NP Oracle
An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function
Allocating rotational cryptanalysis-based preimage attack on 4-round \textsc{Keccak}-224 for quantum setting
An estimator for the hardness of the MQ problem
Algebraic attacks on Rasta and Dasta using low-degree equations
Fast Enumeration Algorithm for Multivariate Polynomials over General Finite Fields
Solving polynomial systems over non-fields and applications to modular polynomial factoring
The regular multivariate quadratic problem
Towards stronger depth lower bounds
Efficient construction of rigid matrices using an NP oracle
Improved algebraic attacks on round-reduced LowMC with single-data complexity
Algorithm 1052: evaluating a Boolean polynomial on all possible inputs
Attacks on Goldreich's pseudorandom generators by grouping and solving
New attacks on LowMC using partial sets in the single-data setting
A simple algorithm for trimmed multipoint evaluation
Low-data cryptanalysis of LowMC instances with full S-box layers

This page was built for publication: Beating brute force for systems of polynomial equations over finite fields

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4575891)