ADFGVX Cipher — The Concept

Information has always needed protection.

Before encryption algorithms, before computers, before radio — there was the simple, urgent need to say something that only one person could understand.

Julius Caesar knew this. His solution was elegant in its simplicity: shift every letter in the message by a fixed number of positions in the alphabet. A becomes D. B becomes E. Z becomes C. You built this in the Control Flow chapter. Today, children use it to pass notes in class. In 44 BC, it protected military orders across the Roman Empire.

That's the arc of cryptography — from a simple shift to quantum-resistant algorithms that protect banking systems, military communications, and the message you send your family tonight. The distance between Caesar's cipher and AES-256 is two thousand years of necessity, ingenuity, and war.

We're going back. Not to Caesar — closer.

The context

The year is 1918. The Western Front. Germany is losing ground, supply lines are stretched, and every order sent over radio is a potential intelligence gift to the Allies.

Colonel Fritz Nebel of the German Army needed a cipher that could be used in the field — under pressure, by operators who weren't mathematicians, with equipment that could be captured at any moment. It had to be fast to encode, hard to break, and resilient to the kind of analysis the Allies were increasingly good at.

What he created was the ADFGVX cipher. Named after the only six letters it used — A, D, F, G, V, X. The choice wasn't arbitrary. In Morse code, these six characters are the most distinct from each other — hardest to confuse under noise, over long distances, in difficult conditions. Every letter in the message would become a pair of these six. Every pair would then be scrambled by a second key.

It was used on the Western Front from March 1918 until June of that year, when French cryptanalyst Georges Painvin broke it — one of the most celebrated feats of cryptanalysis in the First World War. The break came during the German Spring Offensive, and the intelligence it yielded helped the Allies hold the line.

A cipher that lasted three months at the worst moment of the war. Broken by a single man working through the night with nothing but paper, pencil, and extraordinary pattern recognition.

How it works

ADFGVX operates in two steps. Substitution, then transposition.

Step 1 — Substitution. A 6×6 grid is filled with the 26 letters of the alphabet and the digits 0–9 — 36 characters total. The grid's rows and columns are labeled with the six letters: A, D, F, G, V, X. To encode a character, you find it in the grid and replace it with its row label followed by its column label.

If the grid looks like this (simplified example):

  A D F G V X
A P H 0 Q G 6
D 4 M E A 1 Y
F N O F 3 V S
G 7 T 8 K R B
V I L U 5 Z W
X 2 C J 9 D X

The letter M is at row D, column D — so it becomes DD. The letter O is at row F, column D — so it becomes FD. Every character in the message becomes a two-letter pair from the ADFGVX alphabet.

Step 2 — Transposition. The substituted message is written in rows under a keyword. The columns are then rearranged alphabetically by the keyword's letters, and the final ciphertext is read column by column.

The result is a message that has been scrambled twice — once at the character level, once at the structural level. Breaking one layer doesn't break the other.

What we're building

A Python implementation of ADFGVX — encoder and decoder. We'll generate the grid, apply substitution, apply transposition, and reverse both to decrypt.

This is the most technically demanding project in the course. Not because the concepts are new — you know everything you need. Strings, lists, dicts, functions, file handling. But because the logic requires precision. Every step depends on the one before it. A wrong index, a missed conversion — and the decrypted message is noise.

That's also what makes it satisfying.

We start where Nebel started — with the grid.