Caesar Cipher Decoder with All-Shift Ranking
Paste Caesar ciphertext and enter its shift, or inspect all ranked candidates below the result. This example decodes PHHW DW WKH ROG PLOO using shift 3. The ranking tries every nonzero shift of the selected alphabet; on A to Z that is 25 candidates. Lower chi-squared is closer to English letter frequency, but short messages and other languages can rank incorrectly. Read the candidates and use a plausible shift to decode the complete text.
decode A = 0 to Z = 25, wrapping after Z; case kept; spaces, digits and punctuation pass through
| plain | A | B | C | D | E | F | G | H | I | J | K | L | M |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| cipher | D | E | F | G | H | I | J | K | L | M | N | O | P |
| plain | N | O | P | Q | R | S | T | U | V | W | X | Y | Z |
| cipher | Q | R | S | T | U | V | W | X | Y | Z | A | B | C |
- P15 - 3 = 12, M
- H7 - 3 = 4, E
- H7 - 3 = 4, E
- W22 - 3 = 19, T
- D3 - 3 = 0, A
- W22 - 3 = 19, T
- W22 - 3 = 19, T
- K10 - 3 = 7, H
- H7 - 3 = 4, E
- R17 - 3 = 14, O
- O14 - 3 = 11, L
- G6 - 3 = 3, D
and 4 more, worked the same way
encode shift forward 3 to encode again
- Shift
- Alphabet
- Method
- Caesar, shift 3
- Letters shifted
- 16
- Passed through
- 4
- Encode
- shift forward 3 to encode again
Every letter moves the same number of places along the alphabet and wraps round after the last one. Type your own alphabet to shift digits or symbols as well.
Every shift, ranked
All 25 shifts were undone. For each result the letters A to Z are counted and compared with standard English letter frequencies by a chi-squared score, and lower is closer to English. The ranking is an estimate, not a solution: read down until a line makes sense.
Only 16 letters to score. Under 40 letters one unusual word can reorder the list, so read every row.
Textbook checks, one per method
Each row is worked by the same code as the stage above. Load puts it in the workbench with its keys.
Common questions
- Can I decode without the key?
- For Caesar, the small shift space can be inspected directly. Every nonzero shift is listed and ranked. The unchanged input is the zero-shift candidate. This is an English-frequency estimate, not proof of plaintext or a general cipher solver.
- What does a negative shift mean?
- A shift of -3 is equivalent to 23 on A to Z. Encoding adds the shift; decoding subtracts it. Both wrap after the final alphabet character.
- Can I decode a Caesar cipher containing numbers?
- Yes, when the original cipher shifted an alphabet containing digits. Enter that same alphabet in the same order. A to Z leaves digits unchanged; A to Z followed by 0 to 9 shifts all 36 symbols.
Each method follows the convention shown beside it: Caesar shifts count from 0 at the first letter of the alphabet and wrap after the last, the 5 x 5 Polybius and Nihilist squares give I and J one cell, A1Z26 reads 1 26 as AZ, and a book number outside your reference is an error, never a guess. The ranked list of Caesar shifts is an estimate from English letter frequency. These are historical and puzzle ciphers, not modern secure encryption, and the one-time pad mode only shows the arithmetic of the key you type, with no claim that it keeps a message secret.