Cryptanalysis of the Columnar Transposition Using Meta-Heuristics
Eugen Antal, Peter Javorka, Tomáš Hliboký
Source record
Source: Crossref
Published: Aug 1, 2019
DOI: 10.2478/tmmp-2019-0005
Open original source ↗Source abstract
Abstract The most commonly used methods for solving classical (historical) ciphers are based on global optimization (meta-heuristic methods). Despite the fact that global optimization is a well-studied problem, in the case of classical ciphers, there are still many open questions such as the construction of fitness functions or efficient transformation of the cryptanalysis (breaking attempt) to an optimization problem. Therefore the transformation of a cryptanalytical task to an optimization problem and the choice of a suitable fitness function form an important part of the topic. In this paper, we focus on the simple columnar transposition in depth. Our main contribution is a detailed analysis and comparison of different fitness functions, fitness landscape analysis and solving experiments.
Evidence graph
No public relationships recorded yet.
Integrity note: This page is a factual metadata record created by deterministic ingestion. It is not a claim that the work moves a mathematical frontier or has been independently verified.