Solving non-linear Boolean equation systems by variable elimination

DOI10.1007/s00200-019-00399-7zbMath1473.06019OpenAlexW2968391719MaRDI QIDQ2032298

Håvard Raddum, Gunnar Fløystad, Øyvind Ytrehus, 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

zbMATH Keywords

Gröbner basessyzygieselimination of variablessystems of Boolean equationssolving algorithm

Mathematics Subject Classification ID

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)

Uses Software

• SINGULAR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper bounds on the complexity of algebraic cryptanalysis of ciphers with a low multiplicative complexity
• Boolean Gröbner bases
• Polybori: A framework for Gröbner-basis computations with Boolean polynomials
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• On the complexity of solving quadratic Boolean systems
• A crossbred algorithm for solving Boolean polynomial systems
• Fast Exhaustive Search for Polynomial Systems in ${\mathbb{F}_2}$
• Gröbner Bases, Coding, and Cryptography
• On the Number of Linearly Independent Equations Generated by XL
• Cryptanalysis of Block Ciphers with Overdefined Systems of Equations
• Deterministic APSP, Orthogonal Vectors, and More: Quickly Derandomizing Razborov-Smolensky
• Beating Brute Force for Systems of Polynomial Equations over Finite Fields
• Using Algebraic Geometry
• Information Security and Privacy

This page was built for publication: Solving non-linear Boolean equation systems by variable elimination