论文信息 - Parallel Logical Cryptanalysis of the Generator A5/1 in BNB-Grid System

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 we consider some natural strategies for parallelization of these SAT problems. We apply coarse-grained approach which makes it possible to use distributed computing environments with slow interconnect. The main practical result of this paper is successful logical cryptanalysis of keystream generator A5/1 in BNB-Grid system.

[1] Tim Güneysu,et al. Cryptanalysis with COPACOBANA , 2008, IEEE Transactions on Computers.

[2] G. S. Tseitin. On the Complexity of Derivation in Propositional Calculus , 1983 .

[3] David G. Mitchell,et al. Finding hard instances of the satisfiability problem: A survey , 1996, Satisfiability Problem: Theory and Applications.

[4] Alex Biryukov,et al. Real Time Cryptanalysis of A5/1 on a PC , 2000, FSE.

[5] Joao Marques-Silva,et al. GRASP: A Search Algorithm for Propositional Satisfiability , 1999, IEEE Trans. Computers.

[6] Gerhard Goos,et al. Fast Software Encryption , 2001, Lecture Notes in Computer Science.

[7] Fabio Massacci,et al. Logical Cryptanalysis as a SAT Problem , 2000, Journal of Automated Reasoning.

[8] Jovan Dj. Golic,et al. Cryptanalysis of Alleged A5 Stream Cipher , 1997, EUROCRYPT.

[9] Walter Fumy,et al. Advances in Cryptology — EUROCRYPT ’97 , 2001, Lecture Notes in Computer Science.

[10] Alfred Menezes,et al. Handbook of Applied Cryptography , 2018 .

[11] Claude Castelluccia,et al. Extending SAT Solvers to Cryptographic Problems , 2009, SAT.

[12] Mikhail Posypkin,et al. A framework for parallel large-scale global optimization , 2009, Computer Science - Research and Development.

[13] Oliver Kullmann,et al. Theory and Applications of Satisfiability Testing - SAT 2009, 12th International Conference, SAT 2009, Swansea, UK, June 30 - July 3, 2009. Proceedings , 2009, SAT.