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.
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 Vigenère 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.
None of these ciphers stayed secret for good. Simple substitution fell to frequency analysis, first described by the Arab scholar al-Kindi in the 9th century. The Vigenère cipher held out until Charles Babbage (around 1854, unpublished) and Friedrich Kasiski (1863) showed how to find the keyword length. In the twentieth century William Friedman and others turned such one-off methods into general statistical tools — the early modern cryptanalysis covered in the next section. 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.4 — Last updated: 2026-10-25
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.