Pages that link to "Item:Q4575891"
From MaRDI portal
The following pages link to Beating Brute Force for Systems of Polynomial Equations over Finite Fields (Q4575891):
Displayed 18 items.
- Gate elimination: circuit size lower bounds and \#SAT upper bounds (Q1704573) (← links)
- Solving non-linear Boolean equation systems by variable elimination (Q2032298) (← links)
- Cryptanalytic applications of the polynomial method for solving multivariate equation systems over \(\mathrm{GF}(2)\) (Q2056692) (← links)
- Practical complexities of probabilistic algorithms for solving Boolean polynomial systems (Q2065761) (← links)
- The inverse of \(\chi\) and its applications to Rasta-like ciphers (Q2089404) (← links)
- CNF satisfiability in a subspace and related problems (Q2093572) (← links)
- Preimage attacks on 4-round Keccak by solving multivariate quadratic systems (Q2104437) (← links)
- On the complexity of finding tensor ranks (Q2667353) (← links)
- (Q5005182) (← links)
- (Q5090396) (← links)
- (Q5091175) (← links)
- (Q5121894) (← links)
- Counting Solutions to Polynomial Systems via Reductions (Q5240420) (← links)
- Efficient Construction of Rigid Matrices Using an NP Oracle (Q5863325) (← links)
- An effective description of the roots of bivariates mod pk and the related Igusa’s local zeta function (Q6060360) (← links)
- Allocating rotational cryptanalysis-based preimage attack on 4-round \textsc{Keccak}-224 for quantum setting (Q6098292) (← links)
- An estimator for the hardness of the MQ problem (Q6103087) (← links)
- Algebraic attacks on Rasta and Dasta using low-degree equations (Q6157492) (← links)