Open AccessOpen Access


A survey on the Metaheuristics for Cryptanalysis of Substitution and Transposition Ciphers

Arkan Kh Shakr Sabonchi*, Bahriye Akay

Computer Engineering Department, Erciyes University, Kayseri, 38039, Melikgazi, Turkey

* Corresponding Author:Arkan Kh Shakr Sabonchi. Email:

Computer Systems Science and Engineering 2021, 39(1), 87-106.


This paper presents state-of-art cryptanalysis studies on attacks of the substitution and transposition ciphers using various metaheuristic algorithms. Traditional cryptanalysis methods employ an exhaustive search, which is computationally expensive. Therefore, metaheuristics have attracted the interest of researchers in the cryptanalysis field. Metaheuristic algorithms are known for improving the search for the optimum solution and include Genetic Algorithm, Simulated Annealing, Tabu Search, Particle Swarm Optimization, Differential Evolution, Ant Colony, the Artificial Bee Colony, Cuckoo Search, and Firefly algorithms. The most important part of these various applications is deciding the fitness function to guide the search. This review presents how these algorithms have been implemented for cryptanalysis purposes. The paper highlights the results and findings of the studies and determines the gaps in the literature.


Cite This Article

A. K. S.  Sabonchi and B. Akay, "A survey on the metaheuristics for cryptanalysis of substitution and transposition ciphers," Computer Systems Science and Engineering, vol. 39, no.1, pp. 87–106, 2021.

This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 1743


  • 1174


  • 0


Share Link