Abstract
This paper describes a systematic procedure for decrypting simple substitution ciphers with word divisions. The algorithm employs an exhaustive search in a large on-line dictionary for words that satisfy constraints on word length, letter position and letter multiplicity. The method does not rely on statistical or semantical properties of English, nor does it use any language-specific heuristics. The system is, in fact, language independent in the sense that it would work equally well over any language for which a sufficiently large dictionary exists on-line. To reduce the potentially high cost of locating all words that contain specified patterns, the dictionary is compiled into a database from which groups of words that satisfy simple constraints may be accessed simultaneously. The algorithm (using a relatively small dictionary of 19,000 entries) has been implemented in Franz Lisp on a Vax 11/780 computer running 4.3 BSD Unix. The system is frequently successful in a completely automated mode — preliminary testing indicates about a 60% success rate, usually in less than three minutes of CPU time. If it fails, there exist interactive facilities, permitting the user to guide the search manually, that perform very well with minor human intervention.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Roland Anderson, “Finding Vowels in Simple Substitution Ciphers by Computer”, Cryptologia, vol. 8, no. 4, Oct. 1984, pp. 348–358.
Roland Anderson, “Improving the Machine Recognition of Vowels in Simple Substitution Ciphers”, Cryptologia, vol. 10, no. 1, Jan. 1986, pp.10–33.
John H. Carroll and Steve Martin, “The Automated Cryptanalysis of Substitution Ciphers”, Cryptologia, vol. 10, no. 4, Oct. 1986, pp. 193–209.
Shmuel Peleg and Azriel Rosenfeld, “Breaking Substitution Ciphers Using a Relaxation Algorithm”, CACM, vol. 22, no. 11, Nov. 1979, pp. 598–605.
Bruce R. Schatz, “Automated Analysis of Cryptograms”, Cryptologia, vol. 1, no. 2, April 1977, pp. 116–142.
Rajendra Wall, “Decryption of Substitution Cyphers with Word Divisions Using a Content Addressable Memory”, Cryptologia, vol. 4, no. 2, April 1980, pp. 109–115.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lucks, M. (1990). A Constraint Satisfaction Algorithm for the Automated Decryption of Simple Substitution Ciphers. In: Goldwasser, S. (eds) Advances in Cryptology — CRYPTO’ 88. CRYPTO 1988. Lecture Notes in Computer Science, vol 403. Springer, New York, NY. https://doi.org/10.1007/0-387-34799-2_11
Download citation
DOI: https://doi.org/10.1007/0-387-34799-2_11
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-97196-4
Online ISBN: 978-0-387-34799-8
eBook Packages: Springer Book Archive