On construction of efficient algorithms for solving systems of polynomial Boolean equations by testing a part of variables
From MaRDI portal
Publication:2889734
DOI10.1515/DMA.2011.024zbMath1251.68120OpenAlexW2024607216MaRDI QIDQ2889734
Publication date: 8 June 2012
Published in: Discrete Mathematics and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/dma.2011.024
multivariate polynomial equations over \(\mathrm{GF}(2)\)polynomial Boolean equationsvariable testing
Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Boolean functions (06E30)
Cites Work
- On solving sparse algebraic equations over finite fields
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Gaussian elimination is not optimal
- The use of associative information processing for constructing algorithms for solving systems of Boolean equations
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- Exact relation between nonlinearity and algebraic immunity
This page was built for publication: On construction of efficient algorithms for solving systems of polynomial Boolean equations by testing a part of variables
