| P10-1106 | </title> Corlett Penn Abstract | Letter-substitution | ciphers encode a document from |
| D08-1085 | algorithms for automatically solving | letter-substitution | ciphers . Some use heuristic |
| J99-4005 | Such methods can break English | letter-substitution | ciphers of moderate size . Knight |
| P10-1106 | presented an algorithm for solving | letter-substitution | ciphers , with an eye towards |
| P10-1106 | uniticity distance of an English | letter-substitution | cipher ( Bauer , 2007 ) . The |
| J99-4005 | message like EOPPX YXAPF via a fixed | letter-substitution | table . As with tagging , we |
| W13-3009 | Penn ( 2010 ) for deciphering | letter-substitution | ciphers . We argue that the difference |
| P06-2065 | very good to extend unsupervised | letter-substitution | techniques to word-substitution |
| P10-1106 | Exact A * Method for Deciphering | Letter-Substitution | Ciphers </title> Corlett Penn |
| N09-1005 | substantially more difficult than solving | letter-substitution | ciphers ( Knight et al. , 2006 |
| D08-1085 | : • We outline an exact | letter-substitution | decipherment method which : - |
