Authors: Tahar Mekhaznia; Abdelmadjid Zidani
Addresses: LaSTIC Laboratory, University of Batna, Batna 05000, Algeria ' Computer Science Department, University of Batna, Batna 05000, Algeria
Abstract: Recent cryptosystems constitute a hard task for cryptanalysis algorithms due to the nonlinearity of their structure. This problem can be formulated as NP-hard. It has long been subject to various attacks; related results remain insufficient especially when handling wide instances due to resources requirement which increase with the size of the problem. On another side, heuristic methods are techniques able to investigate large spaces of candidate solutions. Swarm intelligence algorithms, part of heuristic methods represent a set of approaches characterised by their fast convergence and easy implementation. The purpose of this paper is to provide a detailed study about the performance of two swarm intelligence algorithms, BAT algorithm and wolf pack search (WPS) algorithm for cryptanalysis of some variant of Feistel ciphers. Experiments were accomplished in order to study the effectiveness of such algorithms in solving the considered problem. Moreover, a comparison with VMMAS, PSO and DE algorithms establishes this advantage.
Keywords: cryptanalysis; Feistel ciphers; BAT algorithm; WPS algorithm; VMMAS algorithm; PSO algorithm; DE algorithm.
International Journal of Information and Communication Technology, 2018 Vol.13 No.1, pp.114 - 138
Available online: 17 Jan 2018 *Full-text access for editors Access for subscribers Purchase this article Comment on this article