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 条
  • [31] A Divide-and-Conquer Approach Towards Understanding Deep Networks
    Fu, Weilin
    Breininger, Katharina
    Schaffert, Roman
    Ravikumar, Nishant
    Maier, Andreas
    MEDICAL IMAGE COMPUTING AND COMPUTER ASSISTED INTERVENTION - MICCAI 2019, PT I, 2019, 11764 : 183 - 191
  • [32] A divide-and-conquer approach for analysing overlaid data structures
    Lee, Oukseh
    Yang, Hongseok
    Petersen, Rasmus
    FORMAL METHODS IN SYSTEM DESIGN, 2012, 41 (01) : 4 - 24
  • [33] A DIVIDE-AND-CONQUER APPROACH TO LEAST-SQUARES ESTIMATION
    ABEL, JS
    IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 1990, 26 (02) : 423 - 426
  • [34] A divide-and-conquer approach to geometric sampling for active learning
    Cao, Xiaofeng
    EXPERT SYSTEMS WITH APPLICATIONS, 2020, 140 (140)
  • [35] JuliusC: A practical approach for the analysis of divide-and-conquer algorithms
    D'Alberto, P
    Nicolau, A
    LANGUAGES AND COMPILERS FOR HIGH PERFORMANCE COMPUTING, 2005, 3602 : 117 - 131
  • [36] EIGENVALUES OF A SYMMETRICAL TRIDIAGONAL MATRIX - A DIVIDE-AND-CONQUER APPROACH
    KRISHNAKUMAR, AS
    MORF, M
    NUMERISCHE MATHEMATIK, 1986, 48 (03) : 349 - 368
  • [37] A divide-and-conquer approach to analyze underdetermined biochemical models
    Kotte, Oliver
    Heinemann, Matthias
    BIOINFORMATICS, 2009, 25 (04) : 519 - 525
  • [38] SAR processing in small pieces - a divide-and-conquer approach
    Larsen, Yngvar
    Engen, Geir
    10TH EUROPEAN CONFERENCE ON SYNTHETIC APERTURE RADAR (EUSAR 2014), 2014,
  • [39] Failure of divide-and-conquer approach in the characterization of unsaturated soils
    Zhang, X.
    UNSATURATED SOIL MECHANICS-FROM THEORY TO PRACTICE, 2016, : 561 - 568
  • [40] Divide-and-conquer algorithms on the hypercube
    Mayr, EW
    Werchner, R
    THEORETICAL COMPUTER SCIENCE, 1996, 162 (02) : 283 - 296