Cryptanalysis of classical ciphers with ant algorithms
by Tahar Mekhaznia; Mohamed El Bachir Menai
International Journal of Metaheuristics (IJMHEUR), Vol. 3, No. 3, 2014

Abstract: Cryptanalysis of classical ciphers has been tackled using metaheuristic optimisation techniques, including ant colony optimisation (ACO) and particle swarm optimisation (PSO). Several variants of ACO algorithms have been developed to improve their search process, but their performance on the same problem may vary significantly according to the pheromone update rule they apply. In this paper, we introduce two versions of ACO algorithms for the cryptanalysis problem of classical ciphers, namely virtual ant system (VAS) and virtual MAX-MIN ant system (VMMAS). We investigate their performance on a large set of ciphertexts obtained by six different encryption methods, including Feistel, Vigenère, simple substitution, affine, carrè de Polybe, and transposition algorithms, and compare their performance against that of ant colony system (ACS) and elitist ant system (EAS). The experimental results demonstrate the overall superiority of VMMAS over the other ant algorithms. Moreover, comparison of VMMAS against a genetic algorithm (GA) establishes its advantage.

Online publication date: Wed, 15-Oct-2014

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your 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