A New Heuristic Based on the Cuckoo Search for Cryptanalysis of Substitution Ciphers

  • Ashish JainEmail author
  • Narendra S. Chaudhari
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9490)


The efficient utilization of one of the latest search heuristic, namely, cuckoo search for automated cryptanalysis (or attack) of substitution ciphers is addressed. A previously proposed genetic algorithm based attack of the simple substitution cipher is enhanced. A comparison is obtained between various attack algorithms that are based on cuckoo search, genetic algorithm, enhanced genetic algorithm, tabu search and scatter search where cuckoo search shows the best performance. It is worth pointing out that the proposed cuckoo search algorithm provides a valid and efficient option for solving similar permutation problems.


Metaheuristics Cuckoo search Genetic algorithm Tabu search Scatter search Cryptanalysis Substitution ciphers 


  1. 1.
    Forsyth, W.S., Safavi-Naini, R.: Automated cryptanalysis of substitution ciphers. Cryptologia 17(4), 407–418 (1993)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Spillman, R., Janssen, M., Nelson, B., Kepner, M.: Use of a genetic algorithm in the cryptanalysis of simple substitution ciphers. Cryptologia 17(1), 31–44 (1993)CrossRefGoogle Scholar
  3. 3.
    Clark, A.: Modern optimisation algorithms for cryptanalysis. In: Proceedings of the 1994 Second Australian and New Zealand Conference on Intelligent Information Systems, pp. 258–262. IEEE (1994)Google Scholar
  4. 4.
    Clark, A.J.: Optimisation heuristics for cryptology. Ph.D. thesis (1998)Google Scholar
  5. 5.
    Garici, M.A., Drias, H.: Cryptanalysis of substitution ciphers using scatter search. In: Mira, J., Álvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 31–40. Springer, Heidelberg (2005) CrossRefGoogle Scholar
  6. 6.
    Song, J., Yang, F., Wang, M., Zhang, H.: Cryptanalysis of transposition cipher using simulated annealing genetic algorithm. In: Kang, L., Cai, Z., Yan, X., Liu, Y. (eds.) ISICA 2008. LNCS, vol. 5370, pp. 795–802. Springer, Heidelberg (2008) CrossRefGoogle Scholar
  7. 7.
    Cowan, M.J.: Breaking short playfair ciphers with the simulated annealing algorithm. Cryptologia 32(1), 71–83 (2008)CrossRefzbMATHGoogle Scholar
  8. 8.
    Boryczka, U., Dworak, K.: Genetic transformation techniques in cryptanalysis. In: Nguyen, N.T., Attachoo, B., Trawiński, B., Somboonviwat, K. (eds.) ACIIDS 2014, Part II. LNCS, vol. 8398, pp. 147–156. Springer, Heidelberg (2014) CrossRefGoogle Scholar
  9. 9.
    Yang, X.S., Deb, S.: Cuckoo search via lévy flights. In: World Congress on Nature & Biologically Inspired Computing, 2009, NaBIC 2009, pp. 210–214. IEEE (2009)Google Scholar
  10. 10.
    Yang, X.S., Deb, S.: Engineering optimisation by cuckoo search. Int. J. Math. Model. Numer. Optimisation 1(4), 330–343 (2010)CrossRefzbMATHGoogle Scholar
  11. 11.
    Yang, X.S., Cui, Z., Xiao, R., Gandomi, A.H., Karamanoglu, M.: Swarm Intelligence and Bio-Inspired Computation: Theory and Applications. Elsevier, Waltham (2013) CrossRefGoogle Scholar
  12. 12.
    Yang, X.S.: Nature-Inspired Optimization Algorithms. Elsevier, Amsterdam (2014) zbMATHGoogle Scholar
  13. 13.
    Mantegna, R.N.: Fast, accurate algorithm for numerical simulation of levy stable stochastic processes. Phys. Rev. E 49(5), 4677–83 (1994)CrossRefGoogle Scholar
  14. 14.
    Glover, F.: Tabu search: a tutorial. Interfaces 20(4), 74–94 (1990)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Discipline of Computer Science and EngineeringIndian Institute of Technology IndoreIndoreIndia
  2. 2.Visvesvaraya National Institute of Technology NagpurNagpurIndia

Personalised recommendations