Solving weakened cryptanalysis problems for the Bivium cipher in the volunteer computing project SAT@home
Олег Сергеевич Заикин, Alexander Alexeevich Semenov, Ilya V. Otpuschennikov · International journal of open information technologies · 2015
In this paper, a SAT-based cryptanalysis of the Bivium stream cipher is considered. For encoding the initial cryptanalysis problem into SAT a special program system Transalg was used. For an obtained SAT instance we use Monte Carlo method to search for a partitioning with good time estimation. Several weakened cryptanalysis instances of the Bivium generator were successfully solved in the volunteer computing project SAT@home using corresponding partitionings found on a computing cluster.