Pages that link to "Item:Q1931429"
From MaRDI portal
The following pages link to On the complexity of solving quadratic Boolean systems (Q1931429):
Displaying 18 items.
- Fuzzy matching template attacks on multivariate cryptography: a case study (Q782142) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← 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)
- Improving Thomae-Wolf algorithm for solving underdetermined multivariate quadratic polynomial problem (Q2118526) (← links)
- Quantum algorithm for Boolean equation solving and quantum algebraic attack on cryptosystems (Q2121215) (← links)
- On affine tropical F5 algorithms (Q2200302) (← links)
- On the efficiency of solving Boolean polynomial systems with the characteristic set method (Q2211189) (← links)
- Speeding up deciphering by hypergraph ordering (Q2339143) (← links)
- Boolean ideals and their varieties (Q2348121) (← links)
- Using small-scale quantum devices to solve algebraic equations (Q2690295) (← links)
- (Q5091175) (← links)
- On the complexity of solving generic overdetermined bilinear systems (Q6163795) (← links)
- Solving polynomial systems over non-fields and applications to modular polynomial factoring (Q6543078) (← links)
- Biscuit: new MPCitH signature scheme from structured multivariate polynomials (Q6547993) (← links)
- A multistep strategy for polynomial system solving over finite fields and a new algebraic attack on the stream cipher Trivium (Q6597203) (← links)
- Concave continuations of Boolean functions and some of their properties and applications (Q6643440) (← links)
