The Implementation and Complexity Analysis of the Branch Gröbner Bases Algorithm Over Boolean Polynomial Rings

DOI10.1007/978-3-662-43799-5_14zbMath1352.68302OpenAlexW187001816MaRDI QIDQ2799559

Yao Sun, Ding-Kang Wang

Publication date: 12 April 2016

Published in: Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-43799-5_14

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Uses Software

• FGb
• PolyBoRi

Cites Work

• A characteristic set method for solving Boolean equations and applications in cryptanalysis of stream ciphers
• Basic principles of mechanical theorem proving in elementary geometries
• A new efficient algorithm for computing Gröbner bases \((F_4)\)

This page was built for publication: The Implementation and Complexity Analysis of the Branch Gröbner Bases Algorithm Over Boolean Polynomial Rings