Cryptanalysis of Four-Rounded DES Using Ant Colony Optimization

It is hard for the cryptanalysts to apply traditional techniques and brute-force attacks against feistel ciphers due to their inherent structure based on high nonlinearity and low autocorrelation. In this paper, we propose a technique for the cryptanalysis of four-rounded Data Encryption Standard (DES) based on Binary Ant Colony Optimization (BACO). A known plaintext attack is used to recover the secret key of the DES cipher. The environment for the ants is a directed graph, which we call search space, is constructed for efficiently searching the secret key. We also develop a heuristic function which measures the quality of a constructed solution. Several optimum keys are computed over different runs on the basis of routes completed by the ants. These optimum keys are then used to find each individual bit of the 56 bit secret key used by DES. The results of our experiments show that ACO is an effective technique for the cryptanalysis of four-rounded DES. To the best of our knowledge, this is the first time that BACO has been used for this specific problem.

[1]  Whitfield Diffie,et al.  Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard , 1977, Computer.

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

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

[4]  J. Carifio,et al.  Nonlinear Analysis , 1995 .

[5]  Habiba Drias,et al.  Cryptanalysis of Substitution Ciphers Using Scatter Search , 2005, IWINAC.

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

[7]  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).

[8]  Mohsin Bilal,et al.  Solution of n-Queen problem using ACO , 2009, 2009 IEEE 13th International Multitopic Conference.

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

[10]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

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

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

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

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

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

[16]  Ralph Howard,et al.  Data encryption standard , 1987 .

[17]  Luca Maria Gambardella,et al.  Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[18]  Luca Maria Gambardella,et al.  Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem , 1995, ICML.

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