The Hagelin M-209 portable encryption device was used by the US Army in World War II and the Korean War, as well as by other armies and in embassy settings. In this paper, we present a
fully automated computerized known-plaintext attack, based on hillclimbing and a novel fitness function - the Aggregate Displacement Error. In our performance evaluation we show that we
are able to recover key settings for messages as short as 50 characters. To validate our results, we solved several publicly available challenge messages, including a message with only 40 letters.
%0 Journal Article
%1 lakowaM209
%A Lasry, George
%A Kopal, Nils
%A Wacker, Arno
%D 2015
%J Cryptologia
%K Automated-Cryptanalysis Hagelin Hillclimbing Known-Plaintext-Attack M-209 itegpub kopal lasry myown
%N ahead-of-print
%P 1-21
%T Automated Known-Plaintext Cryptanalysis of
Short Hagelin M-209 Messages
%U https://www.uni-kassel.de/eecs/fileadmin/datas/fb16/Fachgebiete/UC/papers/Automated_Known-Plaintext_Cryptanalysis_of_Short_Hagelin_M-209_Messages.pdf
%X The Hagelin M-209 portable encryption device was used by the US Army in World War II and the Korean War, as well as by other armies and in embassy settings. In this paper, we present a
fully automated computerized known-plaintext attack, based on hillclimbing and a novel fitness function - the Aggregate Displacement Error. In our performance evaluation we show that we
are able to recover key settings for messages as short as 50 characters. To validate our results, we solved several publicly available challenge messages, including a message with only 40 letters.
@article{lakowaM209,
abstract = {The Hagelin M-209 portable encryption device was used by the US Army in World War II and the Korean War, as well as by other armies and in embassy settings. In this paper, we present a
fully automated computerized known-plaintext attack, based on hillclimbing and a novel fitness function - the Aggregate Displacement Error. In our performance evaluation we show that we
are able to recover key settings for messages as short as 50 characters. To validate our results, we solved several publicly available challenge messages, including a message with only 40 letters.},
added-at = {2014-09-16T09:19:22.000+0200},
author = {Lasry, George and Kopal, Nils and Wacker, Arno},
biburl = {https://www.bibsonomy.org/bibtex/2abfbcc4b9417122de0eb943fc9f5518c/wacker},
description = {http://dx.doi.org/10.1080/01611194.2014.988370},
interhash = {5394e76f3c148283585f84719f99fcc7},
intrahash = {abfbcc4b9417122de0eb943fc9f5518c},
journal = {Cryptologia},
keywords = {Automated-Cryptanalysis Hagelin Hillclimbing Known-Plaintext-Attack M-209 itegpub kopal lasry myown},
number = {ahead-of-print},
pages = {1-21},
timestamp = {2016-05-30T12:14:57.000+0200},
title = {Automated Known-Plaintext Cryptanalysis of
Short Hagelin M-209 Messages},
url = {https://www.uni-kassel.de/eecs/fileadmin/datas/fb16/Fachgebiete/UC/papers/Automated_Known-Plaintext_Cryptanalysis_of_Short_Hagelin_M-209_Messages.pdf},
year = 2015
}