How a substitution cryptogram works
A cryptogram hides a message by replacing every A-Z letter with a different letter. The replacement is consistent from beginning to end. If M becomes X in the first word, every other M also becomes X. This tool also guarantees that no letter stands for itself, so an encrypted E can never be the plain letter E.
Imagine that MEET becomes XUUV. The two Es produce the repeated UU, the word stays four letters long, and its place in the sentence does not move. Spaces and punctuation remain visible too. A solver is not guessing from an empty page: word length, repeated letters, apostrophes, sentence position, and the pattern of nearby words all provide evidence.
- One plain letter has one encrypted partner. The same pair is used everywhere in the message.
- Every encrypted letter points back to one plain letter. Two plain letters never share the same encrypted symbol.
- No letter maps to itself. A visible match can be ruled out immediately.
- The puzzle code controls the key. The same quote and code rebuild the identical worksheet whenever it is needed.
These rules turn a cryptogram into a logic puzzle rather than a collection of separate guesses. Each correct match gives information everywhere that encrypted letter appears.