Asymmetric Encryption: A Deep Dive
summary
Mathematical mechanics of asymmetric crypto are shown with concrete numbers: RSA example n=323 (17×19), e=5, d=29 and a worked ECDSA signing over a tiny field p=11 with curve y^2=x^3+x+5 and base point G=(0,4) so the group operations and signature R,S are explicit. Quantum threat is demonstrated by Shor’s order finding (e.g. a=11 has order r=48 mod 323, enabling factorization). Post‑quantum candidates Kyber and Dilithium, Google’s hardware token work, and Chrome support for hybrid TLS are discussed.
AI-written summary · about
chapters (9)
- 0:00Asymmetric encryption intro
- 5:01Cryptography history
- 10:40How RSA works
- 20:48Group theory in crypto
- 23:42Elliptic curve basics
- 33:18Elliptic Curve Digital Signature Algorithm demo
- 42:37Quantum threat to encryption
- 48:44Post-quantum solutions
- 53:19Future of quantum-resistant crypto
related talks
40mAsymmetric Encryption: A Deep Dive
58mAsymmetric Encryption: A Deep Dive
52mAsymmetric Encryption: A Deep Dive
32mCybersecurity in Post Quantum Era
29mMaths or magic? End-to-end encryption explained like I'm five
58mKeynote: Crypto means Cryptography!
46mFrom substitutions to public keys - an introduction to cryptography
52mMore Secrets of Cryptography