The Caesar Cipher

From the Buttcrack Cipher Wiki — the free field guide to classical ciphers

Try this cipher → Load its worked example and preselect its method.

Reading tools:
Caesar shift cipher wheel
Caesar shift cipher wheel. Publicly available through Wikimedia Commons; see the source page for the author and license.

The operation§

Write the alphabet twice and slide the lower copy by a fixed number of places. With a shift of three, A → D, B → E and Z → C. Every letter gets exactly the same treatment; punctuation and spaces are usually copied unchanged. That simple uniformity is both the cipher's appeal and its fatal weakness.

A tiny keyspace§

The key can be any number from 0 to 25. Shift 0 says nothing was encrypted, so there are only 25 meaningful alternatives. Try each decryption and score the result for English trigrams such as THE, ING and AND. The correct shift rapidly separates itself from the other 24.

Recognising a Caesar shift§

Word lengths, apostrophes, punctuation and repeated-letter patterns are unchanged. The most frequent ciphertext letter is often the encryption of E, and common short words remain the same shape. None of those clues is proof — a substitution cipher has similar surface properties — but a 26-shift sweep is so cheap that there is no reason to guess by eye.

History and legacy§

The cipher is named for Julius Caesar, who reportedly used a fixed shift in Roman military correspondence. Its modern value is educational: it demonstrates modular arithmetic, the difference between a keyspace and a strong keyspace, and the reason letter statistics matter. ROT13 survives as a convention for hiding spoilers, not for protecting secrets.

Next: learn why a repeating sequence of Caesar shifts is harder to spot in the Vigenère cipher guide.

Frequently asked questions§

What is the Caesar cipher formula?

With A equal to 0 through Z equal to 25, encryption is C = P + k mod 26 and decryption is P = C − k mod 26. The key k is the number of places rotated around the alphabet.

Is ROT13 a Caesar cipher?

Yes. ROT13 uses k = 13. Since 13 is exactly half of 26, encryption and decryption are the same operation: applying ROT13 twice returns the original text.

Why is it not secure?

There are only 26 possible rotations, including the unchanged alphabet. A person can list them; a computer can score them all immediately. Frequency analysis is useful, but exhaustive search alone is enough.

The facts in this article are generated from buttcrack's cipher registry when the site is built, so they describe the implementation you can run on this page. Registry-generated content is checked against the code; the history is editorial.

Try it live — break a real puzzle

Private by design

Paste a puzzle. Explore a reading.

Runs on this device

Paste text and press Solve. Ctrl / ⌘ + Enter works too.

Advanced settings & examples

Auto-detect ranks English-looking candidates, not probabilities. A selected method never silently falls back to a different cipher.

Limits & verification boundaries

The browser tries selected classical methods, English statistical scoring and encoding layers. It also recognizes PK1–PK10 by exact normalized corpus equality. It cannot break properly implemented AES/RSA or prove an intended plaintext by a high score. Many wiki methods are only reference demonstrations here; their key-recovery attacks require the full version.

A supplied-key reading is arithmetic under your assumption, not independent confirmation. A worked-example reference is labelled as a build-time lookup, never a newly recovered answer. Rankings show actual returned candidates from a bounded search, which may contain fewer than five.

No analysis upload or account. Nothing is saved unless you choose Save below. This hosted page includes third-party advertising; use a locally served/offline copy for sensitive work.

Solver interface improvements

  • Mobile-first input and solve action, with compact navigation.
  • Simple by default; settings, candidate rankings, statistics and manual controls expand on demand.
  • Every cipher article has a Try this cipher action with its real method and full worked example.
  • Optional named investigations let you save, compare and restore attempts on your own device.
  • Explicit live-operation/reference labels, snapshot boundaries and no automatic text saving.
Optional local investigations — save, compare & restore

Explicit device-only storage, no account or cloud sync. Saved snapshots contain ciphertext, plaintext and keys; browser storage is not encrypted. Deleting browser data removes them. Restore does not run a new search or independently verify an old result.

No automatic text or result saving.

This tool is free and has no account, no upload, no tracking of your text

Everything runs in your browser. If it saved you time, keeping it alive costs nothing but a click.