Substitution Cipher
Replace each letter by any other under a fixed scrambled alphabet — an enormous keyspace that frequency analysis still cracks.
Substitution Cipher
A substitution cipher replaces every letter with another according to a fixed but arbitrary permutation of the alphabet. Unlike the Caesar Cipher, which only rotates the alphabet, here the mapping can be any scramble at all:
plain: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
cipher: Q W E R T Y U I O P A S D F G H J K L Z X C V B N M
So HELLO becomes ITSSG. Decryption just runs the table backwards. Because each plaintext letter always maps to the same ciphertext letter, this is called a monoalphabetic cipher.
A staggering keyspace
How many keys are there? Any of the 26 letters can map to the first slot, any of the remaining 25 to the next, and so on — a full permutation:
That is about 88 bits of key, more than 10^{26} possibilities. Brute force is utterly hopeless — you could try a billion keys a second since the Big Bang and not scratch it. Surely this one is secure?
The crack: frequency analysis
In English, letters are wildly uneven. E alone is about 12.7% of text; T, A, O, I, N follow; J, Q, X, Z are rare. A monoalphabetic cipher renames the letters but cannot change their counts: whatever symbol stands for E will be the most common symbol in the ciphertext. Match the ciphertext's histogram against English's, throw in common pairs (TH, HE) and one-letter words (A, I), and the message unravels.
This is exactly why the cipher is weak despite its colossal keyspace: it has high key entropy but leaks almost everything about the plaintext's structure. The connection to Entropy is the lesson — what matters is not how many keys exist, but how much the ciphertext still tells you about the message. The only way to truly plug the leak is to make the key as informative as the message itself, which leads to the One-Time Pad.