Cryptanalysis of Four-Rounded DES Using Binary Artificial Immune System

In this paper, we present a new approach for the cryptanalysis of four-rounded Data Encryption Standard (DES) based on Artificial Immune System (AIS) The proposed algorithm is a combination of exploitation and exploration of fitness landscape where it performs local as well as global search The algorithm has the property of automatically determining the population size and maintaining the local solutions in generations to generate results close to the global results It is actually a known plaintext attack that aims at deducing optimum keys depending upon their fitness values The set of deduced or optimum keys is scanned to extract the valuable bits out by counting all bits from the deduced key set These valuable extracted bits produce a major divergence from other observed bits This results in a 56-bit key deduction without probing the whole search space To the best of our knowledge, the proposed algorithm is the first attempt to perform cryptanalysis of four-rounded DES using Artificial Immune System.

[1]  Sanyou Zeng,et al.  Advances in Computation and Intelligence, Second International Symposium, ISICA 2007, Wuhan, China, September 21-23, 2007, Proceedings , 2007, ISICA.

[2]  L.N. de Castro,et al.  An artificial immune network for multimodal function optimization , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[3]  M. N. Vrahatisa,et al.  Evolutionary computation based cryptanalysis : A first study , 2005 .

[4]  D. Dasgupta.  Artificial Immune Systems and Their Applications , 1998, Springer Berlin Heidelberg.

[5]  Susan Stepney,et al.  The design of S-boxes by simulated annealing , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[6]  Andrew Clark,et al.  Modern optimisation algorithms for cryptanalysis , 1994, Proceedings of ANZIIS '94 - Australian New Zealnd Intelligent Information Systems Conference.

[7]  Yvo Desmedt,et al.  Advances in Cryptology — CRYPTO ’94 , 2001, Lecture Notes in Computer Science.

[8]  Susan Stepney,et al.  Using Ants to Attack a Classical Cipher , 2003, GECCO.

[9]  Ralph Morelli,et al.  A Study of Heuristic Approaches for Breaking Short Cryptograms , 2004, Int. J. Artif. Intell. Tools.

[10]  A.G. Bafghi,et al.  Finding suitable differential characteristics for block ciphers with Ant colony technique , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

[11]  A. Ribagorda,et al.  Easing collision finding in cryptographic primitives with genetic algorithms , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[12]  Jun Song,et al.  Cryptanalysis of Four-Round DES Based on Genetic Algorithm , 2007, 2007 International Conference on Wireless Communications, Networking and Mobile Computing.

[13]  Mitsuru Matsui,et al.  The First Experimental Cryptanalysis of the Data Encryption Standard , 1994, CRYPTO.

[14]  Julian F. Miller,et al.  Genetic and Evolutionary Computation — GECCO 2003 , 2003, Lecture Notes in Computer Science.

[15]  SpillmanRichard,et al.  Use of a genetic algorithm in the cryptanalysis of simple substitution ciphers , 1993 .

[16]  José María Sierra,et al.  Genetic Cryptoanalysis of Two Rounds TEA , 2002, International Conference on Computational Science.

[17]  Huanguo Zhang,et al.  Cryptanalysis of Two-Round DES Using Genetic Algorithms , 2007, ISICA.

[18]  Don Coppersmith,et al.  The Data Encryption Standard (DES) and its strength against attacks , 1994, IBM J. Res. Dev..

[19]  Jack Dongarra,et al.  Computational Science — ICCS 2002 , 2002, Lecture Notes in Computer Science.

[20]  Farrukh Aslam Khan,et al.  Cryptanalysis of four-rounded DES using binary particle swarm optimization , 2009, GECCO '09.