Parallel logical cryptanalysis of the generator A5/1 in BNB-grid system

Authors:
Alexander Semenov;Oleg Zaikin;Dmitry Bespalov;Mikhail Posypkin
Affiliations:
Institute for System Dynamics and Control Theory, Irkutsk, Russia;Institute for System Dynamics and Control Theory, Irkutsk, Russia;Institute for System Dynamics and Control Theory, Irkutsk, Russia;Institute for Systems Analysis of Russian Academy of Sciences, Moscow, Russia
Venue:
PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies
Year:
2011

Citing 7
Cited 0

GRASP: A Search Algorithm for Propositional Satisfiability

IEEE Transactions on Computers
Handbook of Applied Cryptography

Handbook of Applied Cryptography
Logical Cryptanalysis as a SAT Problem

Journal of Automated Reasoning
Real Time Cryptanalysis of A5/1 on a PC

FSE '00 Proceedings of the 7th International Workshop on Fast Software Encryption
Cryptanalysis with COPACOBANA

IEEE Transactions on Computers
Extending SAT Solvers to Cryptographic Problems

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Cryptanalysis of alleged A5 stream cipher

EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.