Genetic Algorithm Attack on Simplified Data Encryption Standard Algorithm
Poonam Garg · Research in Computing Science · 2006
With the exponential growth of networked & electronic systems, the demand of efficient and fool proof internet security is increasing. Security has emerged as a critical concern in wide range of electronic system. Cryptology is at the heart proving these securities. It consists of two complementary fields of study: cryptography and cryptanalysis. Cryptanalysis is one of the major challenging areas of intense research in the discipline of security. In this paper, we explored the use of genetic algorithm to break a simplified data encryption standard algorithm (SDES). To test its performance, we compared the implemented genetic algorithm attack with brute force search algorithm attack. Through extensive experiments and analysis it can be concluded that 1) genetic algorithms attack run ten times faster than brute force search algorithm attack with accuracy, and 2) genetic algorithms attack are 13% more accurate than brute force search algorithm attack, with same running time. A generalized version of cryptanalysis of SDES will give better insight into the attack of DES and other cipher