Any one-to-one letter substitution has 26! ≈ 4 × 1026 keys — far too many to search — and still falls to letter counting. Encrypt with a random key, then break it: compare frequencies, assign guesses, and watch English appear.
English favours TH, HE, IN, ER, AN, RE, ON, AT.
| Pair | Count |
|---|
One-letter words are A or I. Three-letter words are very often THE or AND.
| Word | Length | Count |
|---|
In English the common doubles are LL, EE, SS, OO, TT, FF, RR, NN, PP.
26! = 403,291,461,126,605,635,584,000,000 keys
A general substitution cipher picks any one-to-one map of the alphabet onto itself. There are 26! of them — about 4 × 1026, which no computer will ever enumerate.
And yet a newspaper cryptogram falls in a few minutes with pencil and paper. The reason is that the key space is irrelevant when the plaintext statistics survive.
Substitution renames letters; it does not change how often they occur, which pairs sit together, or how long the words are. Every one of those is a fingerprint of English.
The order that works, and the one the panels above support:
The tool shows the mechanism — the slides show why it is built that way.
Frequency analysis is the oldest idea in cryptanalysis and still the clearest. One-on-one tutoring walks you through a full solve, then shows exactly what modern ciphers do to prevent it.