Name the moving parts
Separate plaintext, ciphertext, cipher, and key so you can describe exactly what changed.
A visual field manual for substitution, frequency analysis, Vigenère, transposition, and the habits that turn a curious beginner into a capable codebreaker.
Follow six skill phases through fifteen guided checkpoints. Each checkpoint explains one idea, gives you an action, and requires visible evidence before the route continues.
Separate plaintext, ciphertext, cipher, and key so you can describe exactly what changed.
Encrypt and decrypt Caesar text, then search the entire 25-key space instead of guessing.
Count letters and repeated groups to see what fixed substitution fails to hide.
Use repeated-letter signatures and short-word constraints to reject impossible guesses.
See Vigenère as several interleaved Caesar ciphers and expose the weakness created by repetition.
Identify what survives—identity, position, frequency, or periodicity—before selecting a tool.
Read the explanation, perform the requested action, then press Verify evidence. Fifteen checkpoints connect the six phases into one step-by-step investigation.
Seven terms unlock almost every explanation that follows. Click any card to expose a concrete example.
The original readable message.
The transformed encoded message.
The rule used to transform information.
The value or word controlling the transformation.
Turning plaintext into ciphertext.
Recovering plaintext from ciphertext.
Recovering a message without being directly given the key.
First identify what the cipher changes. That choice determines which evidence survives and which attack is sensible.
One fixed shift changes every letter. That simplicity makes Caesar perfect for learning—and easy to brute force.
Represent A as 0 through Z as 25, add the key, then wrap around.
Every letter moves by the same amount, so language structure remains visible.
Test the complete keyspace and validate the whole sentence—not one lucky fragment.
Substitution changes symbols but preserves how often underlying letters appear. That statistical fingerprint is the attacker’s foothold.
A frequent plaintext letter still creates a frequent ciphertext symbol.
Combine several clues; a single frequency match is only a hypothesis.
English averages become more useful as the ciphertext grows longer.
Enter a plaintext guess beneath any cipher letter, then watch the tentative message update.
Frequency narrows possibilities. Repeated-letter structure, word length, and short words turn possibilities into testable hypotheses.
In a fixed substitution, repeated ciphertext letters imply repeated plaintext letters.
A 0-1-1-0 word cannot be MEET because its first and last letters must match.
Structural matches narrow the search; they do not prove a word by themselves.
Each new letter receives a number. Repeated letters reuse the same number.
One-letter words
Usually A or I.
Common pairs
TH, HE, IN, ER, AN.
Common triples
THE, AND, ING.
Contradictions
A monoalphabetic mapping must remain consistent everywhere.
Use frequency, word shape, reversible hypotheses, and contradiction checks together against one genuine monoalphabetic substitution.
The mapping must remain consistent everywhere in the intercept.
A plausible guess remains provisional until it survives the whole message.
The final plaintext stays sealed until every used symbol has a consistent mapping.
Map ciphertext symbols to plaintext. Duplicate plaintext assignments are flagged immediately. Lock mappings only after the evidence is strong.
A keyword supplies a different Caesar shift for each letter. Repetition hides simple frequencies, but creates a new weakness: periodicity.
The key letter supplies a new Caesar shift at each position.
Simple single-letter frequency is spread across several alphabets.
Periodic reuse lets analysts estimate key length and separate the alphabets again.
Find repeated ciphertext sequences.
Measure distances between repetitions.
Factor those distances to estimate key length.
Split letters by key position.
Treat each group as a Caesar cipher.
Substitution changes letter identities. Transposition keeps the letters and changes only their positions.
No symbols are replaced; only their positions change.
Try plausible geometric layouts rather than letter substitutions.
Counts remain identical to the plaintext even when word order disappears.
Letters change. Positions remain.
Letters remain. Positions change.
Select the observations that fit your ciphertext. The field guide will rank the most likely classical family.
Record spaces, symbol counts, repeats, word shapes, and suspected language.
Identity suggests transposition; stable patterns suggest fixed substitution; periodicity suggests repeating keys.
A family identification is a working model, not a verdict.
Choose one or more observations to generate a reasoned first hypothesis.
Preserve the original ciphertext.
Count letters, pairs, triples, and repeated words.
Identify what structure survives.
Record guesses as hypotheses.
Reject mappings that create contradictions.
Reconsider the cipher family when progress stalls.
Most beginner mistakes are not calculation errors. They are reasoning errors: committing too early, ignoring structure, or failing to test globally.
A plausible word is treated as proven.
Track every guess as a reversible hypothesis.
The same ciphertext pattern receives conflicting plaintext guesses.
Use structural signatures before guessing vocabulary.
Several substitutions are altered at once, hiding which one failed.
Change one mapping, then inspect the whole text.
Frequency work produces no stable progress.
Check whether letter counts suggest transposition instead.
Three compact intercepts test fixed-shift search, genuine substitution transfer, and repeating-key control.
This is a genuine fixed substitution using the Case File 01 alphabet. Reuse the crib ZIT = THE, then validate the entire sentence.
The keyword is a five-letter citrus fruit.
A compact field card for deciding what you are looking at and which first attack is justified.
One fixed alphabet shift.
Attack: brute force all 25 shifts.
One fixed scrambled alphabet.
Attack: frequency + word patterns.
Repeating sequence of shifts.
Attack: key length + grouped frequencies.
Letters rearranged, not replaced.
Attack: route and grid reconstruction.