175
Views
2
CrossRef citations
Altmetric

research article

Attacking Letter Substitution Ciphers with Integer Programming

Page 321-334
Published online: 15 Sep 2009
 
Translator disclaimer

Abstract

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 [12 Shannon , C. E. 1949 . “Communication Theory of Secrecy Systems,” Bell System Technical Journal , 28 : 656715 .] theory of uncertainty in decipherment.