Cryptanalysis of substitution ciphers using scatter search

Authors:
Mohamed Amine Garici;Habiba Drias
Affiliations:
Electronics and Computer Science Faculty, Research Laboratory in Artificial Intelligence, LRIA-USTHB, Algiers, Algeria;Computer Science National Institute I.N.I., Algiers, Algeria
Venue:
IWINAC'05 Proceedings of the First international work-conference on the Interplay Between Natural and Artificial Computation conference on Artificial Intelligence and Knowledge Engineering Applications: a bioinspired approach - Volume Part II
Year:
2005

Citing 4
Cited 5

Use of a genetic algorithm in the cryptanalysis of simple substitution ciphers

Cryptologia
Genetic algorithms and tabu search: hybrids for optimization

Computers and Operations Research - Special issue on genetic algorithms
An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem

Journal of Global Optimization
Using ants to attack a classical cipher

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI

Security in outsourcing of association rule mining

VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Cryptanalysis of Transposition Cipher Using Simulated Annealing Genetic Algorithm

ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
Cryptanalysis of four-rounded DES using binary particleswarm optimization

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Cryptanalysis of two-round DES using genetic algorithms

ISICA'07 Proceedings of the 2nd international conference on Advances in computation and intelligence
Steganography by using attributes of magic number 9

Proceedings of the 2011 International Conference on Communication, Computing & Security

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an approach for the automated cryptanalysis of substitution ciphers based on a recent evolutionary metaheuristic called Scatter Search. It is a population-based metaheuristic founded on a formulation proposed two decades ago by Fred Glover. It uses linear combinations on a population subsets to create new solutions while other evolutionary approaches like genetic algorithms resort to randomization. First, we implement the procedures of the scatter search for the cryptanalysis of substitution ciphers. This implementation can be used as a framework for solving permutation problems with scatter search. Then, we test the algorithm and show the importance of the improvement method and the contribution of subset types. Finally, we compare its performances with those of a genetic algorithm.