Answers are grounded in this paper and cite their sources.
In this article, the authors present a detailed introduction to hidden Markov models (HMM). They then apply HMMs to the problem of solving simple substitution ciphers, and they empirically determine the accuracy as a function of the ciphertext length and the number of random restarts. Application to homophonic substitutions and other classic ciphers is briefly considered.
No takes yet. Share an insight, caveat, or question.
Vobbilisetty et al. (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: