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

  • Alexander Semenov
  • Oleg Zaikin
  • Dmitry Bespalov
  • Mikhail Posypkin
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6873)


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.


Logical cryptanalysis SAT stream ciphers A5/1 coarse-grained parallelization Grid 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Cook, S.A., Mitchel, D.G.: Finding hard instances of the satisfiability problem: A survey. In: DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 35, pp. 1–17 (1997)Google Scholar
  2. 2.
    Massacci, F., Marraro, L.: Logical Cryptanalysis as a SAT Problem. Journal of Automated Reasoning 24(1-2), 165–203 (2000)CrossRefzbMATHGoogle Scholar
  3. 3.
    McDonald, C., Charnes, C., Pieprzyk, J.: Attacking Bivium with Minisat. Technical Report, 2007/040, ECRYPT Stream Cipher Project (2007)Google Scholar
  4. 4.
    Semenov, A.A., Zaikin, O.S., Bespalov, D.V., Ushakov, A.A.: SAT-approach for cryptanalysis of some stream ciphering systems. Journal of Computational Technologies 13(6), 134–150 (2008) (in Russian)zbMATHGoogle Scholar
  5. 5.
    Soos, M., Nohl, K., Castelluccia, C.: Extending SAT Solvers to Cryptographic Problems. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 244–257. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  6. 6.
    Afanasiev, A., Posypkin, M., Sigal, I.: Project BNB-Grid: solving large scale optimization problems in a distributed environment. In: 21 International Symposium on Nuclear Electronics and Computing, Dubna, pp. 15–19 (2008)Google Scholar
  7. 7.
    Tseitin, G.S.: On the complexity of derivation in propositional calculus. Studies in Constructive Mathematics and Mathematical Logic, part 2, pp. 115–125 (1968)Google Scholar
  8. 8.
    Guneysu, T., Kasper, T., Novotny, M., Paar, C., Rupp, A.: Cryptanalysis with COPACOBANA. IEEE Transactions on Computers 57(11), 1498–1513 (2008)CrossRefGoogle Scholar
  9. 9.
    Biryukov, A., Shamir, A., Wagner, D.: Real time cryptanalysis of A5/1 on a PC. In: Schneier, B. (ed.) FSE 2000. LNCS, vol. 1978, pp. 1–18. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  10. 10.
    Menezes, A., Van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)CrossRefzbMATHGoogle Scholar
  11. 11.
    The MiniSat page,
  12. 12.
    Marqeus-Silva, J.P., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Trans. on Computers 48(5), 506–521 (1999)CrossRefGoogle Scholar
  13. 13.
  14. 14.
    Evtushenko, Y., Posypkin, M., Sigal, I.: A framework for parallel large-scale global optimization. Computer Science – Research and Development 23(3), 211–215 (2009)CrossRefGoogle Scholar
  15. 15.
    Top 50 CIS Supercomputers,
  16. 16.
    Golic, J.: Cryptanalysis of Alleged A5 Stream Cipher. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 239–255. Springer, Heidelberg (1997)CrossRefGoogle Scholar
  17. 17.
    BOINC: Open-source software for volunteer computing and grid computing,
  18. 18.
    Parallel logical cryptanalysis of the generator A5/1,

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Alexander Semenov
    • 1
  • Oleg Zaikin
    • 1
  • Dmitry Bespalov
    • 1
  • Mikhail Posypkin
    • 2
  1. 1.Institute for System Dynamics and Control TheorySiberian Branch of Russian Academy of SciencesIrkutskRussia
  2. 2.Institute for Systems Analysis of Russian Academy of SciencesMoscowRussia

Personalised recommendations