Attacking Decipherment Problems Optimally with Low-Order N-gram Models

@inproceedings{Ravi2008AttackingDP,
  title={Attacking Decipherment Problems Optimally with Low-Order N-gram Models},
  author={Sujith Ravi and Kevin Knight},
  booktitle={EMNLP},
  year={2008}
}
We introduce a method for solving substitution ciphers using low-order letter n-gram models. This method enforces global constraints using integer programming, and it guarantees that no decipherment key is overlooked. We carry out extensive empirical experiments showing how decipherment accuracy varies as a function of cipher length and n-gram order. We also make an empirical investigation of Shannon’s (1949) theory of uncertainty in decipherment. 
Highly Cited
This paper has 43 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 31 extracted citations

Solving substitution ciphers for OCR with a semi-supervised hidden Markov model

2015 13th International Conference on Document Analysis and Recognition (ICDAR) • 2015
View 1 Excerpt

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Communication theory of secrecy systems

Claude E. Shannon.
Bell System Technical Journal, 28:656–715. • 1949
View 11 Excerpts
Highly Influenced

Theory of linear and integer programming

Wiley-Interscience series in discrete mathematics and optimization • 1999
View 1 Excerpt

Shannon . 1948 . A mathematical theory of communication

E. Claude
Bell System Technical Journal • 1998

Similar Papers

Loading similar papers…