Chris Spackman's NeoCities Page

Traditional Cryptography

Before computers, people used pen-and-paper ciphers to keep messages secret. These pages walk through seven classic ciphers, from the simplest to the theoretically unbreakable. Each one is interactive — type in a message and see how it gets encrypted and decrypted, step by step.

The Story

These ciphers tell a story of escalating sophistication. The Caesar cipher has only 26 possible keys and can be broken in seconds. The substitution cipher has an astronomically large key space but is still breakable with frequency analysis. The Vigenere cipher defeated cryptanalysts for 300 years. The rail fence cipher takes a completely different approach. And the one-time pad is provably unbreakable — but has a fatal practical problem that leads directly into the world of modern cryptography.

The Ciphers

  1. Caesar Cipher — shift each letter by a fixed amount. Trivially breakable: only 26 possible keys.
  2. Substitution Cipher — scramble the entire alphabet. Huge key space (26! ≈ 4 × 1026) but still breakable with frequency analysis.
  3. Playfair Cipher — encrypt letter pairs using a 5×5 grid built from a keyword. Harder to break than single-letter substitution.
  4. Vigenère Cipher — use a repeating keyword to apply different shifts. Considered "unbreakable" for 300 years.
  5. Rail Fence Cipher — rearrange letters in a zigzag pattern instead of replacing them. A completely different approach (transposition instead of substitution).
  6. Columnar Transposition Cipher — write the message into a grid and read columns in keyword-determined order. A more structured transposition cipher.
  7. One-Time Pad — a truly random key as long as the message, used once. Provably unbreakable — but how do you share the key?

What Comes Next?

These ciphers were eventually broken by the methods of early modern cryptanalysis — the statistical and mathematical techniques developed by people like William Friedman. And the one-time pad's fatal weakness, the key distribution problem, eventually led to modern cryptography.

Disclaimer: these pages are educational demos provided as-is, with no warranty of any kind. The author is not responsible for any consequences arising from their use.

Send comments and bug reports to chris@chrisspackman.com.

Version 0.1 — Last updated: 2026-02-21

This page is Copyright © 2025 – 2026 Chris Spackman <chris@chrisspackman.com>.
This web site developed entirely on GNU/Linux with Free / Open Source Software.

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Creative Commons License