DPLL-like satisfiability problem solver over the system of ANF equations

DOI10.17223/2226308X/14/44MaRDI QIDQ6898721zbMATH OpenFDO

Authors A. V. Tkachev, K. V. Kalgin

Publication date 17 November 2025

Published in Prikladnaya Diskretnaya Matematika. Supplement (Search for Journal in Brave)

Full work available at URL https://doi.org/10.17223/2226308X/14/44

zbMATH Keywords

ANFcryptanalysisSAT solverstream ciphers

Mathematics Subject Classification ID

Computer science (68-XX) Operations research, mathematical programming (90-XX)

Cites work

• Algebraic Cryptanalysis
• Empirical study of the anatomy of modern SAT solvers
• The complexity of theorem-proving procedures

This page was built for publication: DPLL-like satisfiability problem solver over the system of ANF equations

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