Solving non-linear Boolean equation systems by variable elimination
DOI10.1007/S00200-019-00399-7zbMATH Open1473.06019OpenAlexW2968391719MaRDI QIDQ2032298FDOQ2032298
Authors: Øyvind Ytrehus, Håvard Raddum, Gunnar Fløystad, Bjørn Møller Greve 
Publication date: 11 June 2021
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-019-00399-7
Recommendations
- On construction of efficient algorithms for solving systems of polynomial Boolean equations by testing a part of variables
- Boolean ring cryptographic equation solving
- On the suppression of variables in Boolean equations
- A crossbred algorithm for solving Boolean polynomial systems
- On the efficiency of solving Boolean polynomial systems with the characteristic set method
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Syzygies, resolutions, complexes and commutative rings (13D02) Boolean functions (06E30)
Cites Work
- Polybori: A framework for Gröbner-basis computations with Boolean polynomials
- Ideals, varieties, and algorithms. An introduction to computational algebraic geometry and commutative algebra
- Using Algebraic Geometry
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- Title not available (Why is that?)
- Efficient algorithms for solving overdefined systems of multivariate polynomial equations
- Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
- Title not available (Why is that?)
- Gröbner Bases, Coding, and Cryptography
- Title not available (Why is that?)
- Deterministic APSP, orthogonal vectors, and more: quickly derandomizing Razborov-Smolensky
- Boolean Gröbner bases
- Fast exhaustive search for polynomial systems in \({\mathbb{F}_2}\)
- Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
- Title not available (Why is that?)
- On the complexity of solving quadratic Boolean systems
- A crossbred algorithm for solving Boolean polynomial systems
- Beating brute force for systems of polynomial equations over finite fields
- On the Number of Linearly Independent Equations Generated by XL
- Information Security and Privacy
Cited In (5)
Uses Software
This page was built for publication: Solving non-linear Boolean equation systems by variable elimination
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2032298)
