Solving the Double Transposition Challenge with a Divide-and-Conquer Approach

被引:12
|
作者
Lasry, George
Kopal, Nils [1 ]
Wacker, Arno [1 ,2 ]
机构
[1] Univ Kassel, Res Grp Appl Informat Secur AIS, Kassel, Germany
[2] Univ Kassel, Kassel, Germany
关键词
challenge; columnar transposition; cryptanalysis; dictionary attack; Doppelwurfel; double transposition; hill climbing; manual ciphers; unsolved ciphers;
D O I
10.1080/01611194.2014.915269
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
The double transposition cipher was considered to be one of the most secure types of manual ciphers. It was extensively used in both World Wars and during the Cold War. In 1999, Otto Leiberich, the former head of the German federal office for information security, suggested that a double transposition challenge be published with specific parameters designed to ensure its security. Such a challenge was published by Klaus Schmeh in 2007. In November 2013, the authors solved the challenge using a ciphertext-only hill climbing attack. They also solved the challenge using a dictionary attack. In this article, they describe both methods, which are based on a "divide-and-conquer'' approach. They additionally discuss the impact of their solutions with respect to the general security of the double transposition cipher.
引用
收藏
页码:197 / 214
页数:18
相关论文
共 50 条
  • [21] Divide-and-Conquer Fusion
    Chan, Ryan S. Y.
    Pollock, Murray
    Johansen, Adam M.
    Roberts, Gareth O.
    JOURNAL OF MACHINE LEARNING RESEARCH, 2023, 24
  • [22] Divide-and-conquer approach for the exemplar breakpoint distance
    Nguyen, CT
    Tay, YC
    Zhang, LX
    BIOINFORMATICS, 2005, 21 (10) : 2171 - 2176
  • [23] A divide-and-conquer approach to acquire syntactic categories
    Gamallo, P
    Lopes, GP
    Da Silva, JF
    GRAMMATICAL INFERENCE: ALGORITHMS AND APPLICATIONS, PROCEEDINGS, 2004, 3264 : 151 - 162
  • [24] HEADINGS, OR DIVIDE-AND-CONQUER
    DOLLE, R
    JOURNAL OF ENVIRONMENTAL HEALTH, 1990, 53 (03) : 56 - 56
  • [25] MULTIDIMENSIONAL DIVIDE-AND-CONQUER
    BENTLEY, JL
    COMMUNICATIONS OF THE ACM, 1980, 23 (04) : 214 - 229
  • [26] Gaussian Process Learning: A Divide-and-Conquer Approach
    Li, Wenye
    ADVANCES IN NEURAL NETWORKS - ISNN 2014, 2014, 8866 : 262 - 269
  • [27] A divide-and-conquer approach for content replication in WMNs
    Al-Arnaout, Zakwan
    Fu, Qiarig
    Frean, Marcus
    COMPUTER NETWORKS, 2013, 57 (18) : 3914 - 3928
  • [28] A Divide-and-Conquer Approach to the Summarization of Long Documents
    Gidiotis, Alexios
    Tsoumakas, Grigorios
    IEEE-ACM TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING, 2020, 28 (28) : 3029 - 3040
  • [29] A divide-and-conquer approach to compressed sensing MRI
    Sun, Liyan
    Fan, Zhiwen
    Ding, Xinghao
    Cai, Congbo
    Huang, Yue
    Paisley, John
    MAGNETIC RESONANCE IMAGING, 2019, 63 : 37 - 48
  • [30] On black-box optimization in divide-and-conquer SAT solving
    Zaikin, O. S.
    Kochemazov, S. E.
    OPTIMIZATION METHODS & SOFTWARE, 2021, 36 (04): : 672 - 696