"Application of the Monte Carlo method for estimating the total time of solving the SAT problem in parallel"
Zaikin O.S. and Semenov A.A.

The application of the Monte Carlo method to plan the solving process for hard examples of the Boolean satisfiability problem (SAT) on parallel computing systems is discussed. The parallelization of the SAT problem is reached as a result of choosing the subset of the set of variables of an original CNF (Conjunctive Normal Form). This set is called a decomposition set. For such sets, we can naturally define a number of parameters to measure the "quality" of decomposition. In order to evaluate these parameters, we use the computational scheme based on the Monte Carlo method. In particular, this method is used to search for the decomposition set with minimal predicted time of solving the original problem. Using the implemented parallel MPI-program, it is possible to obtain a prediction of time required to perform the logical cryptanalysis of the Bivium cipher on a computing cluster. We successfully performed the logical cryptanalysis of several weakened versions of the Bivium cipher. The computing cost of such a cryptanalysis is in agreement with the predicted one.

Keywords: Boolean satisfiability problem (SAT), Monte Carlo method, tabu search, MPI, cryptanalysis, Bivium cipher.

  • Zaikin O.S. – Institute for System Dynamics and Control Theory, Russian Academy of Sciences; ulitsa Lermontova 134, Irkutsk, 664033, Russia; Ph.D., Scientist, e-mail: zaikin.icc@gmail.com
  • Semenov A.A. – Institute for System Dynamics and Control Theory, Russian Academy of Sciences; ulitsa Lermontova 134, Irkutsk, 664033, Russia; Ph.D., Head of Laboratory, e-mail: biclop.rambler@yandex.ru