Using Monte Carlo Method for Searching Partitionings of Hard Variants of Boolean Satisfiability Problem

@article{Semenov2015UsingMC,
  title={Using Monte Carlo Method for Searching Partitionings of Hard Variants of Boolean Satisfiability Problem},
  author={Alexander A. Semenov and Oleg Zaikin},
  journal={ArXiv},
  year={2015},
  volume={abs/1507.00862}
}
In this paper we propose the approach for constructing partitionings of hard variants of the Boolean satisfiability problem SAT. Such partitionings can be used for solving corresponding SAT instances in parallel. We suggest the approach based on the Monte Carlo method for estimating time of processing of an arbitrary partitioning. We solve the problem of search for a partitioning with good effectiveness via the optimization of the special predictive function over the finite search space. For… 
View PDF on arXiv
16 Citations
Background Citations
3
Methods Citations
2

16 Citations

Algorithm for finding partitionings of hard variants of boolean satisfiability problem with application to inversion of some cryptographic functions

This paper proposes an approach for constructing partitionings of hard variants of the Boolean satisfiability problem (SAT), based on the Monte Carlo method, for estimating time of processing of an arbitrary partitioning.

On the Accuracy of Statistical Estimations of SAT Partitionings Effectiveness in Application to Discrete Function Inversion Problems

This paper constructs statistical estimations of effectiveness of SAT partitioning with the help of computational scheme of the Monte Carlo method and proposes the method for improving constructed statistical estimation by using sets of random samples of increasing size followed by the extrapolation of obtained relation to the size of statistical population.

SAT-based search for systems of diagonal latin squares in volunteer computing project SAT@home

  • O. ZaikinS. KochemazovA. Semenov
  • Mathematics, Computer Science
    2016 39th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)
  • 2016
This paper considered the problem of finding pairs of mutually orthogonal diagonal Latin squares of order 10 and reduced it to Boolean satisfiability problem, which led to 29 pairs of described kind, that are different from already known pairs.

Encoding Cryptographic Functions to SAT Using TRANSALG System

The technology for constructing propositional encodings of discrete functions aimed at solving inversion problems of considered functions using state-of-the-art SAT solvers is implemented, and the functionality of Transalg is compared in detail with that of similar software systems.

An Improved SAT-Based Guess-and-Determine Attack on the Alternating Step Generator

An algorithm for constructing guess-and-determine attacks on keystream generators and applying it to the cryptanalysis of the alternating step generator (ASG) and two its modifications (MASG and MASG0).

Translation of Algorithmic Descriptions of Discrete Functions to SAT with Applications to Cryptanalysis Problems

The Transalg software system, developed with SAT-based cryptanalysis specifics in mind, is described and the results of applications of Transalg to construction of a number of attacks on various cryptographic functions are shown.

CDCL(Crypto) and Machine Learning based SAT Solvers for Cryptanalysis

An approach called CDCL(Crypto) is described to tailor the internal subroutines of the CDCL SAT solver with domain-specific knowledge about cryptographic primitives, and a formulation of SAT into Bayesian moment matching to address heuristic initialization problem in SAT solvers is used.

Using automatic generation of relaxation constraints to improve the preimage attack on 39-step MD4

  • I. GribanovaA. Semenov
  • Computer Science
    2018 41st International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)
  • 2018
An automatic method of relaxation constraints generation is suggested by applying the black-box optimization to this function, which made it possible to find new relaxation constraints that contribute to a SAT-based preimage attack on MD4-39 which significantly outperforms the competition.

A Propagation Rate Based Splitting Heuristic for Divide-and-Conquer Solvers

MapleAmpharos is competitive with respect to other competitive parallel solvers such as Treengeling, Plingeling, Parallel CryptoMiniSat5, and Glucose-Syrup and it is surprising that it is obtained primarily by modifying the splitting heuristic.

An Adaptive Parallel SAT Solver

This work presents and evaluates AmPharoS, a new parallel SAT solver based on the divide and conquer paradigm, and proposes a new criterion to dynamically adapt both the amount of shared clauses and the number of cubes.

References

SHOWING 1-10 OF 23 REFERENCES

Grid based propositional satisfiability solving

This work studies how grid and cloud computing can be applied to efficiently solving propositional satisfiability problem (SAT) instances by combining clause learning, a key technique in modern SAT solvers, with the novel types of parallel solvers.

Using BOINC Desktop Grid to Solve Large Scale SAT Problems

This article describes a technology for organizing desktop grid, which is meant for solving SAT problems, implemented in the form of a volunteer computing project SAT@home based on a popular BOINC platform.

Attacking Bivium Using SAT Solvers

The fastest industrial SAT solvers are used to attack a reduced version of Trivium - called Bivium - and the experimental attack time using the SAT solver is the best attack time that is aware of.

Extending SAT Solvers to Cryptographic Problems

A new approach to solving cryptographic problems by adapting both the problem description and the solver synchronously instead of tweaking just one of them is presented, which was able to solve a well-researched stream cipher 26 times faster than was previously possible.

Limitations of restricted branching in clause learning

This work considers branching heuristics in the context of propositional satisfiability (SAT), where CSPs are expressed as propositional formulas and analyzes the effect of input-restricted branching on clause learning solvers in practice with various structured real-world benchmarks.

Conflict-Driven Clause Learning SAT Solvers

This chapter describes the ingredients of conflict-driven clause learning SAT solvers, namely conflict analysis, lazy data structures, search restarts, conflict- driven heuristics and clause deletion strategies.

Tabu Search

From the Publisher: This book explores the meta-heuristics approach called tabu search, which is dramatically changing our ability to solve a hostof problems that stretch over the realms of resource…

Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System

In logical cryptanalysis a problem of search of a secret key of a cryptographic system is formulated as a SAT problem, i.e. a problem of search of a satisfying assignment for some CNF. In this paper…

Cryptanalysis with COPACOBANA

This work describes various exhaustive key search attacks on symmetric ciphers and demonstrates an attack on a security mechanism employed in the electronic passport and introduces efficient implementations of more complex cryptanalysis on asymmetric cryptosystems, e.g., elliptic curve cryptosSystems (ECCs) and number cofactorization for RSA.

Grain of Salt --- an Automated Way to Test Stream Ciphers through SAT Solvers

Grain of Salt is a tool developed to automatically test stream ciphers against standard SAT solver-based attacks and can automatically generate SAT problem instances for Crypto-1, HiTag2, Grain, Bivium-B and Trivium.