Integrating algebraic and SAT solvers

DOI10.1007/978-3-319-72453-9_11MaRDI QIDQ4628487zbMATH OpenOpenAlexFDO

Authors Jan Horáček, Jan Burchard, Bernd Becker, Martin Kreuzer

Publication date 14 March 2019

Published in Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-72453-9_11

zbMATH Keywords

SAT solvingBoolean polynomialcryptographic attackborder basis algorithm

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Cryptography (94A60) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Recommendations

• Algebraic attacks using SAT-solvers
• 3BA: a border bases solver with a SAT extension
• An enhanced binary characteristic set algorithm and its applications to algebraic cryptanalysis
• scientific article; zbMATH DE number 2090051
• A crossbred algorithm for solving Boolean polynomial systems

Cited in

(5)

• On conversions from CNF to ANF
• scientific article; zbMATH DE number 2090051 (Why is no real title available?)
• Algebraic attacks using SAT-solvers
• 3BA: a border bases solver with a SAT extension
• The \textsc{MergeSat} solver

This page was built for publication: Integrating algebraic and SAT solvers

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