Home
Call For Papers
Submission
Author
Registration
Publications
About
Contact Us

  Deciphering of Transposition Ciphers using Genetic Algorithm  
  Authors : Alok Singh Jadaun; Vikas Chaudhary; Lavkush Sharma; Gajendra Pal Singh
  Cite as:

 

Using evolutionary computing for cryptanalysis transposition cipher is an effective and time saving technique. Genetic algorithm also comes under evolutionary computing. These are the simple random section procedure. Transposition cipher is the permutation of the plain text in which only the places of the letters are change according to a particular key which is a group of integer. Cryptanalysis of transposition cipher is a process of finding the key used by the encryption algorithm which can be effectively done using Genetic Algorithm. This paper presents the application of Genetic Algorithm.

 

Published In : IJCSN Journal Volume 3, Issue 3

Date of Publication : 01 June 2014

Pages : 41 - 45

Figures : 08

Tables : 01

Publication Link : Deciphering of Transposition Ciphers using Genetic Algorithm

 

 

 

Alok Singh Jadaun : is currently persuing his M.Tech (C.S.E. II Year) from Bhagwant University Ajmer (Rajasthan).

Er. Vikas Chaudhary : is currently working in Department of Computer Science & Engineering as a Head of Department in Bhagwant University Ajmer. He is M.tech(cs).

Er. Lavkush Sharma : is currently working in Department in Computer Science & Engineering as a Assistant Professor in Raja Balwant Singh Engineering Technical Campus Bichpuri Agra. He is M.tech(C.S.) and 10 years teaching experience.

Gajendra Pal Singh : is currently persuing B.Tech (IV) year in Computer Science & Engineering from Raja Balwant Singh Engineering & Technical Campus Bichpuri Agra.

 

 

 

 

 

 

 

Cryptanalyze

Genetic Algorithms

Transposition Cipher

It was noticed that with increasing key length there was a rapid decrease in the success rate i.e. after the key length value reached up to 6 the success rate was once in seven attempts with 20 numbers of generations. Hence one should increase the maximum number of generation as the key length is increased.

 

 

 

 

 

 

 

 

 

[1] Clark, A.J., “Optimization Heuristics for Cryptology”. Thesis PhD, in Information Security Research Centre, Faculty of Information Technology, Queensland University of Technology, February 1998.

[2] Stallings, W., "Cryptography And Network Security, Principle And Practices", 3rd Edition, Pearson Education, 2005.

[3] Rolf,O., "Contemporary Cryptography" Artech House Computer Security Series, Boston- London, 2005.

[4] William Stallings., “Cryptography and Network Security, Principles and Practices”, 3rd edition, Pearson Education, 2004.

[5] Andrew John Clark, “Optimization Heuristics for Cryptology” / PhD thesis, Information Security Research Centre Faculty of Information Technology Queensland University of Technology, February 1998.

[6] Andrew John Clark, “Optimization Heuristics for Cryptology” / PhD thesis, Information Security Research Centre Faculty of Information Technology Queensland University of Technology, February 1998.

[7] David E. Goldberg, “Genetic Algorithms in search, Optimization and Machine Learning,”, New Delhi: Dorling Kindersley (India), pp. 7.

[8] A.S.Al-Khalid, S.S. Omran Dalal, A.Hammood, “Using Genetic Algorithms To Break A Simple Transposition Cipher”, Foundation of Technical Education College Of Elec. & Electronic Techniques (Baghdad-IRAQ), May 8, 2013.

[9] R.Toemeh, Department of computer Science and Engineering, Government College of Technology, S.Arumugam, Additional Director, Directorate of technical education, Chennai, India, “Breaking Transposition Cipher With Genetic Algorithm”,2007.

[10] Karel P.Bergmann, Renate Scheidler, Christian Jacob, “Cryptanalysis Using Genetic Algorithms”, University Of Calagary 2500 University Dr. NW Calgary, AB, Canda, Page no 1099,1100.