doi: 10.7763/IJCTE.2010.V2.177
Nomadic Genetic Algorithm for Cryptanalysisof DES 16
Abstract
Key determination in the Cryptanalysis of DES-16is considered to be a NP hard problem that involves a large search space. Multi-population Genetic Algorithms are considered to be more effective than single population genetic algorithm for such types of problems in obtaining the optimal solution in lesser time. In this direction, this paper presents a novel multi-population genetic Algorithm called Nomadic Genetic Algorithm (NGA) for breaking the encrypted message created using full 16 round Data Encryption Standard(DES) in less than 2 36 complexities. A comparison of the performance of Standard GA (SGA) and NGA is also presented. The performance of the algorithm is found to be better and considerably faster than exhaustive search and other existing GA
Keywords
- Genetic Algorithm
- Nomadic Genetic Algorithm
- Cryptanalysis
- DES
- Multi-population GA
How to Cite
S. Siva Sathya, T. Chithralekha, and P. Ananda Kumar, "Nomadic Genetic Algorithm for Cryptanalysisof DES 16," International Journal of Computer Theory and Engineering, vol. 2, no. 3, pp. 411-415, 2010. https://doi.org/10.7763/IJCTE.2010.V2.177
Copyright & License
Copyright © 2010 by the authors. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).