Cryptanalysis of Transposition Cipher Using Hill Climbing and Simulated Annealing

Conference paper
Part of the Advances in Intelligent Systems and Computing book series (AISC, volume 336)

Abstract

The need of an efficient encryption process has always been felt to hide the information from others during communication. In earlier days, the method of encryption was using paper and pen only and the term used for these encryption techniques was classical ciphers. Transposition cipher is one of the most popular classical ciphers. This is also called a permutation cipher where characters in the plain text are reshuffled to form a ciphertext according to a given permutation key. Various techniques apart from brute-force have been used to break transposition ciphers in ciphertext-only attack mode. These techniques mainly involve combinatorial optimization-based techniques such as hill climbing, simulated annealing, genetic algorithms and tabu search. In this paper, we have used hill climbing, simulated annealing and combination of these two for breaking transposition ciphers in ciphertext-only attack mode.

Keywords

Combinatorial optimization Cryptanalysis Cryptography Transposition cipher 

References

  1. 1.
    Clark, A.J.: Optimization heuristics for cryptology. Ph.D. Thesis, Information Security Research Centre, Faculty of Information Technology, Queensland University of Technology (1998)Google Scholar
  2. 2.
    Clark, A., Dawson, E.: Optimisation heuristics for the automated cryptanalysis of classical ciphers. JCMMCC 28, 63–86 (1998)MATHMathSciNetGoogle Scholar
  3. 3.
    Forsyth, W.S., Safavi-Naini, R.: Automated cryptanalysis of substitution ciphers. Cryptologia 17(4), 407–418 (1993)CrossRefMATHGoogle Scholar
  4. 4.
    Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671–680 (1983)CrossRefMATHMathSciNetGoogle Scholar
  5. 5.
    Metropolis, N., Rosenblunth, A.W., Rosenblunth, M.N., Teller, A.H., Teller, E.: Equations of state calculations by fast computing machines. J. Chem. Phys. 21(6), 1087–1092 (1953)CrossRefGoogle Scholar
  6. 6.
    Michael, J.C.: Breaking short playfair ciphers with the simulated annealing algorithm. Cryptologia 32, 71–83 (2008)CrossRefMATHGoogle Scholar
  7. 7.
    Ratan, R.: Applications of genetic algorithms in cryptology. In: Proceedings of 3rd International Conference on Soft Computing for Problem Solving (SOCPROS-2013), vol. 258, pp. 821–831, Springer’s AISC (2014)Google Scholar
  8. 8.
    Richard, S.: Cryptanalysis of knapsack ciphers using genetic algorithms. Cryptologia 17(4), 367–377 (1993)CrossRefMATHGoogle Scholar
  9. 9.
    Robert, M.A.J.: The use of genetic algorithms in cryptanalysis. Cryptologia 17(2), 187–201 (1993)CrossRefGoogle Scholar
  10. 10.
    Shivgurunathan, G., Rajendran, V., Purusothaman, T.: Classification of substitution ciphers using neural networks. Int. J. Comput. Sci. Netw. Secur. 10(3), 274–279 (2010) Google Scholar
  11. 11.
    Stallings, W.: Cryptography and Network Security: Principles and Practice, 5th edn. Pearson Education, Upper Saddle River (2013)Google Scholar
  12. 12.
    Wikipedia: Hill Climbing. http://en.wikipedia.org/wiki/Hill_climbing (2014)

Copyright information

© Springer India 2015

Authors and Affiliations

  1. 1.SAGDefence R&D OrganizationDelhiIndia

Personalised recommendations