Using Python for National Cipher Challenge
summary
Python code brute forces the Solitaire cipher used in the 2015 National Cipher Challenge by keying each deck with every English word (about 1 million candidates) and checking short prefixes (20–30 chars) with a fast English detector built from bigrams from Alice in Wonderland rather than slow trigrams. The program keys decks, simulates the card shuffles, decrypts quickly, and flags high-scoring decrypts; a live demo recovers the keyword baboon instantly and the full challenge is solved after handling a burned‑deck twist (~36 hours total), finishing in the top 2%.
AI-written summary · about
chapters (6)
- 0:00Start
- 0:14The National Cyber Challenge
- 2:05Task Eight Solitaire Cipher
- 3:29Solitaire Cipher
- 5:20The Solitaire Cipher
- 8:42Engrams
related talks
51m48 Dirty Little Secrets Cryptographers Don’t Want You To Know
25mAdvanced Python
25mAdvanced Python
01h 30mHow To Write a Rubik’s Cube Solver
30mFORKS? POOLS? ASYNC? Solving Wordle with Python’s concurrency tools
40mSolving the web most popular code shortening competition in Python.
43mCode-based Cryptography
01h 48mSimple Games for Python Beginners