A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Classical Ciphers and Cryptanalysis

Graduate Depth 77 in the knowledge graph ☐ I know this ☆ Set as goal
36topics build on this
364prerequisites beneath it
See this on the map →
Modular Arithmetic and CongruencesCounting Principles: Addition and Multiplication Rules→→Perfect Secrecy and the One-Time Pad
substitution-cipher transposition-cipher frequency-analysis kerckhoffs-principle

Core Idea

Classical ciphers -- substitution, transposition, and their combinations -- formed the basis of secret communication for centuries. Studying them introduces core cryptographic concepts (keys, keyspaces, Kerckhoffs' principle) and, equally important, the methods used to break them. Frequency analysis, known-plaintext attacks, and pattern exploitation demonstrate why security through obscurity fails and why modern cryptography demands mathematically grounded definitions of security.

Explainer

Before modern cryptography existed as a mathematical discipline, civilizations relied on classical ciphers to protect secrets. These fall into two broad families. Substitution ciphers replace each symbol in the plaintext with a different symbol according to some rule — the Caesar cipher shifts every letter by a fixed amount, while a general monoalphabetic cipher uses an arbitrary permutation of the alphabet. Transposition ciphers rearrange the positions of plaintext symbols without altering them — a columnar transposition, for instance, writes the message into a grid and reads out columns in a permuted order. More sophisticated classical systems, like the Enigma machine, combine both operations in multiple rounds.

The study of classical ciphers matters not because anyone would use them today, but because their vulnerabilities establish the foundational principles of modern cryptography. Frequency analysis, developed by Arab scholars in the 9th century, showed that monoalphabetic substitution preserves the statistical fingerprint of the plaintext language — 'E' remains the most common symbol regardless of what it's renamed to. Polyalphabetic ciphers like the Vigenere attempted to defeat frequency analysis by using multiple alphabets, but their periodic key repetition introduced its own exploitable patterns. The recurring lesson is that any cipher with deterministic, structured behavior leaks information through statistical regularities.

These failures motivated two crucial principles. Kerckhoffs' principle (1883) states that a cipher's security must depend entirely on the secrecy of the key, not the algorithm. If the algorithm is compromised, the system should remain secure as long as the key is unknown. This principle drove cryptography from art toward science: instead of inventing clever-seeming schemes and hoping no one can break them, cryptographers define precise security goals and prove that breaking the cipher requires solving a problem believed to be computationally hard. The second principle is that security requires formal definitions — vague notions like "hard to break" are insufficient because clever adversaries find attacks that intuition misses.

Classical cryptanalysis also introduced the taxonomy of attack models still used today: ciphertext-only (the attacker sees only encrypted messages), known-plaintext (the attacker has some matched plaintext-ciphertext pairs), chosen-plaintext (the attacker can choose messages to be encrypted), and chosen-ciphertext (the attacker can choose ciphertexts to be decrypted). Modern ciphers must be secure under the strongest of these models. The progression from "we think this is secure" to "we can prove this is secure under stated assumptions" is the intellectual arc from classical to modern cryptography, and understanding why classical ciphers fail is the essential first step along that arc.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Introduction to Exponents → Order of Operations → Integer Order of Operations → Variable Expressions → The Distributive Property → Variables and Expressions Review → Introduction to Polynomials → Adding and Subtracting Polynomials → Multiplying Polynomials → Factorial → Permutations → Combinations → Counting Principles: Addition and Multiplication Rules → Introduction to Graph Theory → Propositional Logic Foundations → Logical Equivalences → Set Operations: Union, Intersection, and Complement → Proof by Cases → Proving by Cases and Exhaustion → Vacuous Truth and Trivial Cases → Proof by Cases (Proof by Exhaustion) → Mathematical Induction → Divisibility and Greatest Common Divisor → The Euclidean Algorithm → Modular Arithmetic and Congruences → Classical Ciphers and Cryptanalysis

Longest path: 78 steps · 364 total prerequisite topics

Prerequisites (2)

Leads To (1)