Sirvi Autor "Ekhall, Magnus" järgi

Nüüd näidatakse 1 - 2 2

Playfair crib validation as a constraint satisfaction problem
(Tartu University Library, 2025) Ekhall, Magnus; Antal, Eugen; Marák, Pavol
This paper shows how a crib1 for a Playfair enciphered message can be seen as a constraint satisfaction problem. This problem can then be solved with standard constraint programming tools. The solution will tell whether the crib is possible, and if so, can list all possible Playfair keys that would result in the given crib.
The TICOM DF-114 Cryptanalytic Device - A Theory of Operation and Computer Simulation
(Tartu University Library, 2024) Ekhall, Magnus; Waldispühl, Michelle; Megyesi, Beáta
The M-209 cipher machine was used extensively by the U.S.A. during WorldWar II. It is known that German cryptanalysts under certain circumstances were able to decipher M-209 enciphered messages using pen-and-paper techniques. A German wartime document found by the allies’ Target Intelligence Committee (TICOM) in 1947 describes a electromechanical machine that supposedly could be used as an aid when breaking M-209 enciphered messages. The document, designated DF-114 by TICOM, is quite technical but does not describe how the device would work. This paper suggests a theory of how the device could have been used, and by creating a computer simulation of the device described in DF-114 explores the viability of the theory.