On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra

DOI10.1007/s11424-015-4085-1zbMath1388.13057OpenAlexW1902612769MaRDI QIDQ328226

Yao Sun, Ding-Kang Wang, Dong-Dai Lin, Zhen Yu Huang

Publication date: 20 October 2016

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-015-4085-1

zbMATH Keywords

Gröbner basisimplementationlinear algebraBoolean polynomial rings

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) Sampling theory in information and communication theory (94A20)

Related Items

On the efficiency of solving Boolean polynomial systems with the characteristic set method ⋮ Speeding up the GVW algorithm via a substituting method ⋮ An improvement over the GVW algorithm for inhomogeneous polynomial systems

Uses Software

• M4RI
• Stony Brook

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An improvement over the GVW algorithm for inhomogeneous polynomial systems
• A new efficient algorithm for computing Gröbner bases \((F_4)\)
• GVW algorithm over principal ideal domains
• Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
• Advances in Cryptology - CRYPTO 2003