On black-box optimization in divide-and-conquer SAT solving

DOI10.1080/10556788.2019.1685993MaRDI QIDQ5085259zbMATH OpenOpenAlexFDO

Authors S. E. Kochemazov, Oleg Sergeevich Zaikin

Publication date 27 June 2022

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556788.2019.1685993

zbMATH Keywords

Monte-Carlo methodSATcryptanalysisdivide-and-conquerblack-box optimizationpseudo-Boolean optimization

Mathematics Subject Classification ID

Boolean programming (90C09)

Recommendations

• Black-box optimization in an extended search space for SAT solving
• Search techniques for SAT-based Boolean optimization
• SAT-approach to cryptography of some stream ciphering systems
• Logical cryptanalysis as a SAT problem
• Applications of SAT Solvers to Cryptanalysis of Hash Functions

Cites work

• scientific article; zbMATH DE number 4050837 (Why is no real title available?)
• scientific article; zbMATH DE number 1113991 (Why is no real title available?)
• scientific article; zbMATH DE number 954401 (Why is no real title available?)
• scientific article; zbMATH DE number 7199588 (Why is no real title available?)
• scientific article; zbMATH DE number 5493266 (Why is no real title available?)
• scientific article; zbMATH DE number 3325539 (Why is no real title available?)
• A machine program for theorem-proving
• ALIAS: a modular tool for finding backdoors for SAT
• Algebraic Cryptanalysis
• Application of optimization methods for finding equilibrium states of two-dimensional crystals
• Attacking Bivium Using SAT Solvers
• Black-box optimization in an extended search space for SAT solving
• Branch-and-Bound Methods: A Survey
• Contradiction immunity and guess-then-determine attacks on GOST
• Derivative-free and blackbox optimization
• Efficient global optimization of expensive black-box functions
• Error detecting and error correcting codes
• Future paths for integer programming and links to artificial intelligence
• Handbook of metaheuristics
• Logical cryptanalysis as a SAT problem: Encoding and analysis of the U. S. Data Encryption Standard
• New stream cipher designs. The eSTREAM finalists
• On the analysis of the \((1+1)\) evolutionary algorithm
• PSATO: A distributed propositional prover and its application to quasigroup problems
• Parallel logical cryptanalysis of the generator A5/1 in BNB-grid system
• Partitioning SAT instances for distributed solving
• Random forests
• SAT race 2015
• Temporal induction by incremental SAT solving
• The Monte Carlo Method
• The complexity of theorem-proving procedures
• Tools and Algorithms for the Construction and Analysis of Systems
• Two Trivial Attacks on Trivium
• URSA: a system for uniform reduction to SAT
• Variable neighborhood search: Principles and applications
• `` Direct Search Solution of Numerical and Statistical Problems

Cited in

(3)

• Global optimization problems associated with cryptographic analysis of asymmetric ciphers
• Optimizing S-Box Implementations for Several Criteria Using SAT Solvers
• Black-box optimization in an extended search space for SAT solving

Describes a project that uses

Uses Software

• GitHub
• CryptoSAT
• SMAC
• ALIAS
• Grain
• Transalg
• URSA
• eSTREAM
• MICKEY
• CBMC
• Rabbit
• EGO
• Trivium
• SATO
• PSATO
• MiniSat

This page was built for publication: On black-box optimization in divide-and-conquer SAT solving

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