Eric Corlett

Learn More
In this paper we investigate the theoretical causes of the disparity between the theoretical and practical running times for the A∗ algorithm proposed in Corlett and Penn (2010) for deciphering letter-substitution ciphers. We argue that the difference seen is due to the relatively low entropies of the probability distributions of character transitions seen(More)
An Exact A* Method for Solving Letter Substitution Ciphers Eric Corlett Master of Science Graduate Department of Computer Science University of Toronto 2011 Letter-substitution ciphers encode a document from a known or hypothesized language into an unknown writing system or an unknown encoding of a known writing system. The process of solving these ciphers(More)
  • 1