Answers are grounded in this paper and cite their sources.
We use simulated annealing to provide an automated method for the cryptanalysis of mono-alphabetic substitution ciphers. We prove the convergence of the algorithm and study its performance for a specific cooling schedule. We discuss the merits of this approach and show that it provides a simple, fast and elegant solution to the cryptanalysis problem which is also promising for more complex types of block ciphers.
No takes yet. Share an insight, caveat, or question.
Forsyth et al. (1993) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: