Fantastic Ciphers and How to Break Them
summary
Overview of how classical and modern cryptosystems — from Caesar cipher up to RSA and ElGamal — can be broken using number theory and logical analysis. Describes concrete weaknesses and attack techniques that reveal vulnerabilities in systems often considered secure.
AI-written summary · about
chapters (12)
- 0:00Introduction
- 1:30Why cryptography matters
- 4:17Symmetric vs asymmetric
- 6:25Number theory basics
- 10:24RSA and prime numbers
- 12:31Caesar cipher and frequency
- 16:24Prime numbers in crypto
- 24:28RSA algorithm explained
- 26:58Attacks on RSA
- 31:51Elgamal and discrete log
- 35:28Birthday attack on Elgamal
- 40:10Q&A
related talks
51mBeyond cryptography
31mBeyond Cryptography
46mFrom substitutions to public keys - an introduction to cryptography
19mModern Cryptography & Implementation Flaws
01h 04m Cryptography For Newcomers - The hitchhiker's guide to cipher in devs 
42mEverything I always wanted to know about crypto
42mCryptography, hashing, encryption without the math
51m48 Dirty Little Secrets Cryptographers Don’t Want You To Know