Efficient checking of separating indeterminates

DOI10.1007/S11786-025-00616-2MaRDI QIDQ6918454zbMATH OpenFDO

Authors Bernhard Andraschko, Martin Kreuzer

Publication date 10 October 2025

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

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S11786-025-00616-2

zbMATH Keywords

AES cryptosystemBoolean polynomialelimination idealGroebner basisseparating indeterminates

Mathematics Subject Classification ID

Commutative rings and modules of finite generation or presentation; number of generators (13E15) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Affine spaces (automorphisms, embeddings, exotic structures, cancellation problem) (14R10)

Cites work

• Algebraic attacks using SAT-solvers
• Boolean Gröbner bases. Theory, algorithms and applications
• CoCoA-5.2.2 and CoCoALib
• Computing border bases
• Cotangent spaces and separating re-embeddings
• Elimination by substitution
• scientific article; zbMATH DE number 1515218 (Why is no real title available?)
• scientific article; zbMATH DE number 2206382 (Why is no real title available?)
• msolve. A library for solving polynomial systems
• Polybori: A framework for Gröbner-basis computations with Boolean polynomials
• Re-embeddings of affine algebras via Gröbner fans of linear ideals
• Restricted Gröbner fans and re-embeddings of affine algebras
• SAT solving using XOR-OR-AND normal forms.
• The close relation between border and Pommaret marked bases

This page was built for publication: Efficient checking of separating indeterminates

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6918454)