Modular Arithmetic & the Caesar Cipher
You'll learn to
- -Apply modular arithmetic to implement a wrap-around character shift
- -Implement and reverse a Caesar cipher
- -Explain why a shift cipher is trivially breakable, and what that implies about real cryptography
The security chapters of this course are about cryptography, but they lean on math you already have: modular arithmetic (the % operator) for wrap-around, and hashing concepts from way back in the hashmap tier - now with a very different set of guarantees. Level 28 starts at the simplest possible cipher: the Caesar cipher, named for Julius Caesar, who reportedly used a shift of 3 to encode military messages.
Shifting With Wrap-Around
A Caesar cipher shifts every letter forward by a fixed amount k, wrapping back to 'a' after 'z'. That wrap-around is exactly what the modulo operator is for: convert a letter to its 0-25 index, add the shift, take the result mod 26 to wrap it back into range, then convert back to a character. Decryption is the same operation with the shift negated - (index - k) % 26 - which is why Python's % operator (which always returns a non-negative result for a positive modulus, unlike some other languages) matters here: it makes the negative-shift case just work without special-casing.
Why This Is a Stepping Stone, Not Real Security
A Caesar cipher has exactly 26 possible keys (25 useful ones, since a shift of 0 does nothing), so brute-forcing every shift and eyeballing which one produces readable text takes a human seconds and a computer microseconds. Even without brute force, English letter-frequency analysis - 'e' and 't' are the most common letters in English text - cracks it almost as fast, since a shift preserves the relative frequency pattern. It illustrates the vocabulary real cryptography builds on - key, plaintext, ciphertext, encrypt and decrypt as inverse operations - without any of the actual security. The rest of this module builds toward algorithms where "just try every key" is computationally infeasible, not merely inconvenient.
Never use a Caesar cipher, or any shift or substitution cipher, for anything that actually needs to be secret. Its only job in this course is to introduce the vocabulary and the modular-arithmetic mechanics that real cryptography (SHA-256, RSA) builds on top of.
What makes the Caesar cipher insecure, beyond it just being old?
"It's old and simple so it's insecure."
"It has a key space of only 26 possible shifts, so brute-forcing every one and checking which produces readable text is instant - and even without brute force, letter-frequency analysis breaks it almost as fast, since the shift preserves the relative frequency pattern of English letters. Real ciphers need a key space and structure that make exhaustive or statistical attacks computationally infeasible, not just inconvenient."
Why is the modulo operator essential to implementing a Caesar cipher shift?
Level 28: Caesar Cipher Codex has you implement shift-based encryption and decryption using modular arithmetic on character codes - the same wrap-around logic above, plus handling edge cases like case and non-alphabetic characters.