Swarm intelligence algorithms in cryptanalysis of simple Feistel ciphers Online publication date: Mon, 19-Mar-2018
by Tahar Mekhaznia; Abdelmadjid Zidani
International Journal of Information and Communication Technology (IJICT), Vol. 13, No. 1, 2018
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Information and Communication Technology (IJICT):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook