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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Campos, V., Glover, F., Laguna, M., Martí, R.: An Experimental Evaluation of a Scatter Search for the Linear Ordering Problem. Journal of Global Optimization 21 (2001)
Clark, A.J.: Optimisation Heuristics for Cryptology. PhD Thesis, Queensland University of Technology (1998)
Clark, J.A.: Metaheuristic Search as a Cryptological Tool. PhD Thesis, University of York (2001)
Drias, H., Azi, N.: Scatter search for SAT and MAX-W-SAT problems. In: Ohio, U.S.A. (ed.) Proceedings of the IEEE SSST, Ohio, USA (2001)
Forsyth, W.S., Safavi-Naini, R.: Automated cryptanalysis of substitution ciphers. Cryptologia 4(17) (1991)
Glover, F.: Heuristics for Integer Programming Using Surrogate Constraints. Decision Sciences 8(1) (1977)
Glover, F., Kelly, J.P., Laguna, M.: Genetic Algorithms and Taboo Search: Hybrids for Optimization. Computers and Operation Reseach 22(1) (1995)
Glover, F.: A Template for Scatter Search and Path Relinking. Notes in Computer Sciences. Springer, Heidelberg (1998)
Laguna, M., Armentano, V.: Lessons from Applying and Experimenting with Scatter Search. In: Rego, C., Alidaee, B. (eds.) Adaptive Memory and Evolution: Tabu Search and Scatter Search (2003)
Russell, M., Clark, J.A., Stepney, S.: Using Ants to Attack a Classical Cipher. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, Springer, Heidelberg (2003)
Spillman, R., Janssen, M., Nelson, B., Kepner, M.: Use of a genetic algorithm in the cryptanalysis of simple substitution ciphers. Cryptologia 17(1) (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Garici, M.A., Drias, H. (2005). Cryptanalysis of Substitution Ciphers Using Scatter Search. In: Mira, J., Álvarez, J.R. (eds) Artificial Intelligence and Knowledge Engineering Applications: A Bioinspired Approach. IWINAC 2005. Lecture Notes in Computer Science, vol 3562. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11499305_4
Download citation
DOI: https://doi.org/10.1007/11499305_4
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26319-7
Online ISBN: 978-3-540-31673-2
eBook Packages: Computer ScienceComputer Science (R0)