BibSonomy :: publication :: Solving the Double Transposition Challenge with a Divide and Conquer Approach
URLDOITeX

Solving the Double Transposition Challenge with a Divide and Conquer Approach

George Lasry, Nils Kopal, and Arno Wacker. Cryptologia (to appear)

Abstract

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 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 we solved the challenge using a ciphertext only hill climbing attack. We also solved the challenge using a dictionary attack. In this paper we describe both methods, which are based on a "divide and conquer" approach. We additionally discuss the impact of our solutions with respect to the general security of the double transposition cipher.

Links and resources

BibTeX key:lasry2014dct
internal link:
?
You can use this internal link to create references to this post in your discussions. Just copy this internal link and paste it in your discussion text.
search on:

Comments or reviews  
(0)

There is no review or comment yet. You can write one!

Tags

  • Last update 4 months and 2 days ago
  • Created 4 months and 2 days ago

Cite this publication