License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CP.2021.13
URN: urn:nbn:de:0030-drops-153040
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2021/15304/
Antuori, Valentin ;
Portoleau, Tom ;
Rivière, Louis ;
Hebrard, Emmanuel
On How Turing and Singleton Arc Consistency Broke the Enigma Code
Abstract
In this paper, we highlight an intriguing connection between the cryptographic attacks on Enigma’s code and local consistency reasoning in constraint programming.
The coding challenge proposed to the students during the 2020 ACP summer school, to be solved by constraint programming, was to decipher a message encoded using the well known Enigma machine, with as only clue a tiny portion of the original message. A number of students quickly crafted a model, thus nicely showcasing CP technology - as well as their own brightness. The detail that is slightly less favorable to CP technology is that solving this model on modern hardware is challenging, whereas the "Bombe", an antique computing device, could solve it eighty years ago.
We argue that from a constraint programming point of vue, the key aspects of the techniques designed by Polish and British cryptanalysts can be seen as, respectively, path consistency and singleton arc consistency on some constraint satisfaction problems.
BibTeX - Entry
@InProceedings{antuori_et_al:LIPIcs.CP.2021.13,
author = {Antuori, Valentin and Portoleau, Tom and Rivi\`{e}re, Louis and Hebrard, Emmanuel},
title = {{On How Turing and Singleton Arc Consistency Broke the Enigma Code}},
booktitle = {27th International Conference on Principles and Practice of Constraint Programming (CP 2021)},
pages = {13:1--13:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-211-2},
ISSN = {1868-8969},
year = {2021},
volume = {210},
editor = {Michel, Laurent D.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2021/15304},
URN = {urn:nbn:de:0030-drops-153040},
doi = {10.4230/LIPIcs.CP.2021.13},
annote = {Keywords: Constraint Programming, Cryptography}
}
