Classical Substitution
The arms race between letter-mappers and frequency counters
For a thousand years after Caesar, cryptographers mapped letters to other symbols and believed their ciphers were unbreakable. Then in 850 AD, Al-Kindi of Baghdad wrote a nine-page treatise that shattered every substitution cipher ever made — and every one that would be made for the next four centuries. This hall shows the battle that followed.
Al-Kindi's insight (850 AD): Count how often each letter appears in ciphertext. The most frequent symbol probably represents E (12.7% of English). The second most frequent is probably T (9.1%). Map frequencies to expected values — the key reveals itself. This technique alone broke every cipher in this hall.
Each letter maps permanently to another. A→Q, B→M, C→L… The key is a full 26-letter permutation, giving 26! possible keys — more than 4×10²⁶. Vast keyspace, zero protection.
Cipher: QWERTYUIOPASDFGHJKLZXCVBNM
The Renaissance answer to frequency analysis: give common letters multiple symbols. E encrypts as 12, 37, or 44. T as 21 or 90. Frequency peaks flatten. Used in European diplomatic ciphers for 400 years.
A → 05, 63 Z → 99
Charles Wheatstone's breakthrough: encrypt letter pairs, not single letters. A 5×5 key square defines rules for each pair. Defeats single-letter frequency analysis completely. Used by Britain in WWI and WWII.
Lester Hill applied linear algebra to cryptography. Letters become vectors; the key is a matrix; encryption is matrix multiplication. Strong diffusion — every output letter depends on multiple input letters. Broken by known plaintext.
The Substitution Arms Race
Al-Kindi's 850 AD technique. Every monoalphabetic cipher is broken by counting symbol frequencies and matching them to known language distributions. The Caesar cipher is a trivial special case.
Assign multiple ciphertexts to common letters to flatten frequency peaks. A sophisticated attacker can still detect the homophonic system through structural patterns and solve it with enough ciphertext.
Playfair encrypts letter pairs; AES encrypts 128-bit blocks. The principle is the same: operate on multiple characters simultaneously to defeat single-character statistical attacks.
Hill's matrix multiplication concept — mixing multiple input letters to produce each output letter — became the MixColumns step in AES, one of the four core operations providing diffusion.