Nature inspired heuristics for attack of simplified DES algorithm
Tahar Mekhaznia · 2013
Modern ciphers constitute a challenge task for cryptanalysis algorithms due to their diversity and nonlinearity. This problem can be formulated as NP-Hard. It has long been subject to various attacks; available results, emerged many years ago remain insufficient when handling large instances due to resources requirement which increase with the size of the problem. On another side, computational intelligence represents a set of methodologies used to solve difficult optimization problems. This is mainly due to their ability to converge with acceptable resource consumption. The purpose of this paper is to provide a more detailed study of the performance of three computational metaheuristics: Particle swarm optimization, differential evolution and for a first time, genetic programing for cryptanalysis of a simplified variant of Data encryption standard algorithm. Experiments were performed to study the effectiveness of these algorithms in solving the considered problem and underline the difficulties encountered.