Solving Substitution Ciphers with Combined Language Models
Solving Substitution Ciphers with Combined Language Models
B. Hauer,R. Hayward,Grzegorz Kondrak
2014 · DBLP: conf/coling/HauerHK14
International Conference on Computational Linguistics · 23 Citations
TLDR
A novel approach to deciphering short monoalphabetic ciphers that combines both character-level and word-level language models is proposed, and Monte Carlo Tree Search (MCTS) is used as a fast alternative to beam search.
