Hall II · Ancient roots — 20th century

Classical Substitution

The arms race between letter-mappers and frequency counters

Fixed substitutions preserve recognizable structure. Al-Kindi’s surviving treatise explains frequency analysis; later homophonic, digraph and algebraic constructions change what patterns remain. Their attacks require different evidence and methods.

Medieval Renaissance Victorian 3 Hard-to-Break Exhibits
💀

Frequency analysis compares observed counts with language models. It is useful against fixed substitutions but does not by itself solve every system in this hall. The exhibits distinguish statistical guesses, known plaintext and exhaustive key search.

What This Hall Teaches

The Substitution Arms Race

Frequency Analysis

Al-Kindi's 850 AD technique. Monoalphabetic substitution preserves language-frequency patterns. With enough suitable ciphertext, frequency counts and word patterns can reveal the substitution; short messages need not have a unique solution. The Caesar cipher is a trivial special case.

Homophonic Defense

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.

Digraph Encryption → AES Blocks

Playfair encrypts letter pairs; AES encrypts 128-bit blocks. Both operate on blocks, but this alone does not establish security. AES combines nonlinear and linear operations under a modern security model.

Matrix Multiplication → Modern Mixing

Hill’s cipher and AES MixColumns both mix multiple input symbols using linear algebra, but they use different fields and play different roles. A linear layer alone does not provide the nonlinear security of a complete modern block cipher.

← Previous Hall Hall I: World Origins of Cryptography