Codebusters
A high-velocity cryptanalysis race. Apply modular arithmetic, frequency analysis, and pattern recognition to decrypt complex monoalphabetic and polyalphabetic ciphers under a tight timer.
What You'll Learn
- To crack substitution ciphers using letter frequency profiles.
- How modular arithmetic underlies classical cryptosystems.
- How to compute matrix determinants and modular inverses.
- To divide labor across a 3-person sprint team for peak speed.
Big Questions
Frequency & Pattern Analysis
- Aristocrats & Patristocrats: Decrypting 1-to-1 letter substitutions (with or without spacing/punctuation) using frequency graphs, double-letter guides, and common word patterns (cribs).
- Xenocrypts: Cracking Spanish monoalphabetic substitutions using Spanish letter frequencies (e.g., high-frequency 'E', 'A', 'O', 'S') and accent configurations.
- Baconian & Atbash: Structural decoding of bilateral binary-style Bacon ciphers and simple mirror-alphabet Atbash.
Advanced Modular Ciphers
- Modular Arithmetic Ciphers: Solving Caesar, Affine ($E(x) = (ax + b) \pmod{26}$), and Hill Ciphers (utilizing $2 \times 2$ and $3 \times 3$ matrix operations, determinants, and cofactors).
- Polyalphabetic Ciphers: Decrypting Vigenère ciphers using key placement grids and tabular structures.
- Transposition Ciphers: Navigating Rail Fence, Pollux/Morbit Morse conversions, and RSA Public Key fundamentals (prime selection, totient, modular exponentiation).