Pages that link to "Item:Q1009070"
From MaRDI portal
The following pages link to On solving sparse algebraic equations over finite fields (Q1009070):
Displayed 9 items.
- MaxMinMax problem and sparse equations over finite fields (Q285259) (← links)
- An application of combinatorics in cryptography (Q322183) (← links)
- Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity (Q510448) (← links)
- Improved agreeing-gluing algorithm (Q2254079) (← links)
- Speeding up deciphering by hypergraph ordering (Q2339143) (← links)
- Local reduction and the algebraic cryptanalysis of the block cipher GOST (Q2392058) (← links)
- A combinatorial problem related to sparse systems of equations (Q2402975) (← links)
- Sparse Boolean equations and circuit lattices (Q2430703) (← links)
- On construction of efficient algorithms for solving systems of polynomial Boolean equations by testing a part of variables (Q2889734) (← links)