WHY THIS MATTERS
Caesar and substitution operate on visible symbols.
BROWSER-ONLY EDUCATIONAL SIMULATION
A museum workbench for following a transformation from visible letters to bit logic.
USE EXAMPLE TEXT — DO NOT ENTER REAL SECRETS. Everything here is transformed locally in your browser; this lab does not contact or access external systems.
LETTERS → ALPHABET MAPPING
“Caesar cipher” names the historically associated shift-cipher concept: each alphabetic letter moves by a fixed number of positions. Spaces, punctuation, and numbers stay put.
ABCDEFGHIJKLMNOPQRSTUVWXYZSHIFTEDLETTER SHIFT · 13 POSITIONS
ROT13 is a Caesar shift of exactly 13 positions. In a 26-letter alphabet, applying it twice returns every letter to its original position.
FIXED SHIFT → ARBITRARY MAPPING
A monoalphabetic substitution replaces each letter with one chosen counterpart. It has vastly more possible mappings than a Caesar cipher—but repeated language patterns still leak structure.
ABCDEFGHIJKLMNOPQRSTUVWXYZSUBSTITUTION ALPHABETCHARACTER CODES → BITS → LOGIC
| A | B | XOR |
|---|---|---|
| 0 | 0 | 0 |
| 0 | 1 | 1 |
| 1 | 0 | 1 |
| 1 | 1 | 0 |
XOR is a fundamental operation used throughout computing and cryptography—not a complete secure cipher by itself. Security depends on its construction and key handling. A one-time pad is information-theoretically secret only with a truly random, message-length key used once and kept secret. This repeating-key illustration is not AES or secure messaging.
Caesar and substitution operate on visible symbols.
Computers represent symbols as numbers, then as bits.
XOR combines bits according to logic and can reverse itself with the same key.