Double Transposition
Two columnar transpositions compose two position permutations
Anagramming · Hill climbing (difficult)
Why This Matters
Double transposition can make reconstruction substantially harder than one pass. Its security still depends on message length, column widths, key selection, padding and available related traffic. A count of key pairs is not a measured security level.
German forces used double transposition during the First World War, and related systems appeared in later military and agent communications. This operational history does not establish the German military as the original inventor. Applying two transpositions creates another permutation of the same letters; their frequencies remain unchanged.
Computer attacks can exploit language scores and structural constraints. Short ciphertexts or unknown dimensions may make a particular attack difficult or ambiguous, while other instances are recoverable. Comparisons should state the keys, text length, search budget and success criterion.
Apply columnar transposition twice using two different keywords:
Step 1: Apply columnar transposition with key MARK Step 2: Apply columnar transposition with key LION There are k1! × k2! pairs of column-order settings when each key can be any permutation of its columns. Different pairs may induce the same permutation; this is not a proof of k1! × k2! distinct ciphertexts.
A 7-letter key gives 5,040 possible column orders. Two such keys give 25,401,600 ordered key pairs. Structured cryptanalysis need not enumerate them all.
Heuristic solvers can search candidate keys using language scores, moves such as swaps, and repeated restarts. Results depend on the implementation and instance. No universal number of iterations or guaranteed recovery time follows from the cipher name alone.
| Concept from Double Transposition | Modern Evolution |
|---|---|
| Two-pass permutation | AES applies 10–14 rounds of operations — multiple passes through cipher structure |
| Large combined keyspace | AES 128-bit key: 2¹²⁸ possible keys — exponentially larger |
| No substitution, only permutation | AES combines nonlinear SubBytes, byte-reordering ShiftRows, and linear MixColumns (omitted in the final round) |
| Exhibit | 15 of 172 |
| Era | WWI · Germany |
| Trust | Broken |
| Inventor | No single inventor established here |
| Year | Documented military use in the First World War |
| Key Type | Two columnar keywords |
| Broken By | Anagramming · Hill climbing (difficult) |
Sources and Reading
David Kahn, The Codebreakers: The Comprehensive History of Secret Communication from Ancient Times to the Internet, revised edition (1996), discussion of First World War transposition practice. George Lasry, A Methodology for the Cryptanalysis of Classical Ciphers with Search Metaheuristics (2018), treats attacks as experiments with defined instances and evaluation criteria.