Abstract
Evolutionary computation has represented a very popular way of problem solving in the recent years. This approach is also capable of effectively solving historical cipher in a fully automated way. This paper deals with empirical cryptanalysis of a monoalphabetic substitution using a genetic algorithm (GA) and a parallel genetic algorithm (PGA). The key ingredient of our contribution is the parameter analysis of GA and PGA. We focus on how these parameters affect the success rate of solving the monoalphabetic substitution.
Language: English
Page range: 179 - 197
Submitted on: Oct 31, 2017
Published on: Mar 23, 2018
Published by: Slovak Academy of Sciences, Mathematical Institute
In partnership with: Paradigm Publishing Services
Publication frequency: 1 issue per year
Related subjects:
© 2018 Eugen Antal, Martin Eliáš, published by Slovak Academy of Sciences, Mathematical Institute
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.