Attacking decipherment problems optimally with low-order n-gram models

EMNLP 2008 - 2008 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference: A Meeting of SIGDAT, a Special Interest Group of the ACL

Volumn , Issue , 2008, Pages 812-819

  Ravi, Sujith ^a   Knight, Kevin ^a  

^a UNIVERSITY OF SOUTHERN CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY; INTEGER PROGRAMMING; NATURAL LANGUAGE PROCESSING SYSTEMS;

EMPIRICAL EXPERIMENTS; EMPIRICAL INVESTIGATION; GLOBAL CONSTRAINTS; LOW ORDER; N-GRAM MODELS; N-GRAMS; SHANNON; SUBSTITUTION CIPHERS;

COMPUTATIONAL LINGUISTICS;

EID: 80053366075     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1613715.1613819     Document Type: Conference Paper

References (12)

1. Friedrich L. Bauer. 2006. Decrypted Secrets: Methods and Maxims of Cryptology. Springer-Verlag.
2. Thorsten Brants, Ashok C. Popat, Peng Xu, Franz J. Och, and Jeffrey Dean. 2007. Large language models in machine translation. In Proceedings of EMNLPCoNLL.
3. Ciprian Chelba and Frederick Jelinek. 1999. Structured language modeling for speech recognition. In Proceedings of NLDB: 4th International Conference on Applications of Natural Language to Information Systems.
4. Ravi Ganesan and Alan T. Sherman. 1993. Statistical techniques for language recognition: An introduction and guide for cryptanalysts. Cryptologia, 17(4):321-366.
5. David Graff and Rebecca Finch. 1994. Multilingual text resources at the linguistic data consortium. In Proceedings of the HLT Workshop on Human Language Technology.
6. Thomas Jakobsen. 1995. A fast method for cryptanalysis of substitution ciphers. Cryptologia, 19(3):265-274.
7. Kevin Knight, Anish Nair, Nishit Rathod, and Kenji Yamada. 2006. Unsupervised analysis for decipherment problems. In Proceedings of the COLING/ACL.
8. Edwin Olson. 2007. Robust dictionary attack of short simple substitution ciphers. Cryptologia, 31(4):332-342.
9. Shmuel Peleg and Azriel Rosenfeld. 1979. Breaking substitution ciphers using a relaxation algorithm. Comm. ACM, 22(11):598-605.
10. Alexander Schrijver. 1998. Theory of Linear and Integer Programming. John Wiley & Sons.
11. Claude E. Shannon. 1948. A mathematical theory of communication. Bell System Technical Journal, 27:379-423 and 623-656.
12. Claude E. Shannon. 1949. Communication theory of secrecy systems. Bell System Technical Journal, 28:656-715.