Breaking of Simplified Data Encryption Standard Using Binary Particle Swarm Optimization

Cryptanalysis of cipher text by using evolutionary algorithm has gained so much interest in last few years. This paper demonstrates the use of Binary Particle Swarm Optimization with bit change mutation operator for cryptanalysis of S-DES and then compared the results with Genetic Algorithm. An experimental result shows that Binary PSO performs better than the genetic algorithms for such type of problem. Here the cipher text attack is considered and several keys are generated in the iteration of the Binary Particle Swarm Optimization algorithm on the basis of their cost function value which depends upon letter frequency. The results on the S-DES indicate that, this is a promising method and can be adopted to handle other complex block ciphers like DES, AES.

[1]  Kostas Papadopoulos,et al.  Communication network design using Particle Swarm Optimization , 2008, 2008 International Multiconference on Computer Science and Information Technology.

[2]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[3]  Poonam Garg.  Genetic Algorithm Attack on Simplified Data Encryption Standard Algorithm , 2006 .

[4]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

[5]  S. Arumugam,et al.  Breaking Transposition Cipher with Genetic Algorithm , 2007 .

[6]  Mitsuru Matsui,et al.  Linear Cryptanalysis Method for DES Cipher , 1994, EUROCRYPT.

[7]  R. K. Ursem.  Multi-objective Optimization using Evolutionary Algorithms , 2009 .

[8]  Nostrand Reinhold,et al.  the utility of using the genetic algorithm approach on the problem of Davis, L. (1991), Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York. , 1991 .

[9]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[10]  Edward F. Schaefer.  A Simplified Data Encryption Standard Algorithm , 1996, Cryptologia.

[11]  Richard Spillman,et al.  Use of a genetic algorithm in the crypt-analysis of simple substitution ciphers , 1993 .

[12]  William Stallings,et al.  Cryptography and Network Security: Principles and Practice , 1998 .

[13]  Wenjun Zhang,et al.  Dissipative particle swarm optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[14]  Zbigniew Michalewicz,et al.  Evolutionary optimization of constrained problems , 1994 .

[15]  Keigo Watanabe,et al.  Evolutionary Optimization of Constrained Problems , 2004 .

[16]  Sangwook Lee,et al.  Binary Particle Swarm Optimization with Bit Change Mutation , 2007, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[17]  Richard Spillman,et al.  Cryptanalysis of Knapsack Ciphers Using Genetic Algorithms , 1993, Cryptologia.

[18]  M. L. Valarmathi,et al.  Cryptanalysis of simplified-DES using computational intelligence , 2011 .

[19]  Yilmaz Kaya,et al.  A Novel Crossover Operator for Genetic Algorithms: Ring Crossover , 2011, ArXiv.

[20]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[21]  D. E. Goldberg,et al.  Optimization and Machine Learning , 2022 .