Genetic algorithms are a population-based Meta heuristics. They have been successfully applied to many optimization problems. However, premature convergence is an inherent characteristic of such classical genetic algorithms that makes them incapable of searching numerous solutions of the problem domain. A memetic algorithm is an extension of the traditional genetic algorithm. It uses a local search technique to reduce the likelihood of the premature convergence. The cryptanalysis of simplified data encryption standard can be formulated as NP-Hard combinatorial problem. In this paper, a comparison between memetic algorithm and genetic algorithm were made in order to investigate the performance for the cryptanalysis on simplified data encryption standard problems(SDES). The methods were tested and various experimental results show that memetic algorithm performs better than the genetic algorithms for such type of NP-Hard combinatorial problem. This paper represents our first effort toward efficient memetic algorithm for the cryptanalysis of SDES. This paper proposes the cryptanalysis of simplified encryption standard algorithm using memetic and genetic algorithm. The cryptanalysis of simplified data encryption standard can be formulated as NP-Hard combinatorial problem. Solving such problems requires effort (e.g., time and/or memory requirement) which increases with the size of the problem. Techniques for solving combinatorial problems fall into two broad groups - traditional optimization techniques (exact algorithms) and non traditional optimization techniques (approximate algorithms). A traditional optimization technique guarantees that the optimal solution to the problem will be found. The traditional optimization techniques like branch and bound, simplex method, brute force search algorithm etc methodology is very inefficient for solving combinatorial problem because of their prohibitive complexity (time and memory requirement). Non traditional optimization techniques are employed in an attempt to find an adequate solution to the problem. A non traditional optimization technique - memetic algorithm, genetic algorithm, simulated annealing and tabu search were developed to provide a robust and efficient methodology for cryptanalysis. The aim of these techniques to find sufficient "good" solution efficiently with the characteristics of the problem, instead of the global optimum solution, and thus it also provides attractive alternative for the large scale applications. These nontraditional optimization techniques demonstrate good potential when applied in the field of cryptanalysis and few relevant studies have been recently reported. In 1993 Spillman (16) for the first time presented a genetic algorithm approach for the cryptanalysis of substitution cipher using genetic algorithm. He has explored the possibility of random type search to discover the key (or key space) for a simple substitution cipher. In the same year Mathew (12) used an order based genetic algorithm for cryptanalysis of a transposition cipher. In 1993, Spillman (17), also successfully applied a genetic algorithm approach for the cryptanalysts of a knapsack cipher. It is based on the application of a directed random search algorithm called a genetic algorithm. It is shown that such a algorithm could be used to easily compromise even high density knapsack ciphers. In 1997 Kolodziejczyk (11) presented the application of genetic algorithm in cryptanalysis of knapsack cipher .In 1999 Yaseen (18) presented a genetic algorithm for the cryptanalysis of Chor-Rivest knapsack public key cryptosystem.
[1]
Lawrence. Davis,et al.
Handbook Of Genetic Algorithms
,
1990
.
[2]
N. Nalini,et al.
Cryptanalysis of Simplified Data Encryption Standard via Optimization Heuristics
,
2005,
2005 3rd International Conference on Intelligent Sensing and Information Processing.
[3]
Robert A. J. Matthews,et al.
The Use of Genetic Algorithms in Cryptanalysis
,
1993,
Cryptologia.
[4]
Bernd Freisleben,et al.
Memetic Algorithms for the Traveling Salesman Problem
,
2002,
Complex Syst..
[5]
Poonam Garg,et al.
Genetic Algorithm & Tabu Search Attack on The Mono-Aiphanetic Substitution Cipher
,
2005
.
[6]
John H. Holland,et al.
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence
,
1992
.
[7]
Poonam Garg.
Genetic Algorithm Attack on Simplified Data Encryption Standard Algorithm
,
2006
.
[8]
Reihaneh Safavi-Naini,et al.
Automated Cryptanalysis of Transposition Ciphers
,
1994,
Comput. J..
[9]
Pablo Moscato,et al.
On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts : Towards Memetic Algorithms
,
1989
.
[10]
David E. Goldberg,et al.
Genetic Algorithms in Search Optimization and Machine Learning
,
1988
.
[11]
Richard Spillman,et al.
Cryptanalysis of Knapsack Ciphers Using Genetic Algorithms
,
1993,
Cryptologia.
[12]
Goldberg,et al.
Genetic algorithms
,
1993,
Robust Control Systems with Genetic Algorithms.
[13]
H. V. Sahasrabuddhe,et al.
A genetic algorithm for the cryptanalysis of Chor-Rivest knapsack public key cryptosystem (PKC)
,
1999,
Proceedings Third International Conference on Computational Intelligence and Multimedia Applications. ICCIMA'99 (Cat. No.PR00300).
[14]
SpillmanRichard,et al.
Use of a genetic algorithm in the cryptanalysis of simple substitution ciphers
,
1993
.
[15]
Edward F. Schaefer.
A Simplified Data Encryption Standard Algorithm
,
1996,
Cryptologia.
[16]
Richard Spillman,et al.
Use of a genetic algorithm in the crypt-analysis of simple substitution ciphers
,
1993
.