Asymmetric Encryption: A Deep Dive
summary
Concrete claims and worked examples drive the content: RSA worked example: p=17 q=19 n=323 e=5 d=29 showing why factoring n yields the private key, an elliptic curve over Z11 with 11 points demonstrating group arithmetic and smaller key sizes, and a sketch of Shor order finding with a=11 r=48 recovering factors of 323 that breaks RSA on a quantum machine. Post‑quantum swaps are concrete too: CRYSTALS‑Kyber and CRYSTALS‑Dilithium reach NIST adoption and browsers/OS tooling begin rolling out support.
AI-written summary · about
chapters (13)
- 0:00Introduction
- 1:08Cryptography history
- 4:38Need for asymmetric crypto
- 5:21RSA encryption
- 12:46RSA limitations
- 14:31Group theory in crypto
- 18:01Elliptic curve crypto
- 24:17RSA vs elliptic curves
- 25:21Quantum threat to encryption
- 29:57Post-quantum solutions
- 33:12Quantum-resistant algorithms
- 34:38Future of quantum crypto
- 37:05Summary
related talks
52mAsymmetric Encryption: A Deep Dive
58mAsymmetric Encryption: A Deep Dive
56mAsymmetric Encryption: A Deep Dive
15mRSA encryption in 10 minutes
46mFrom substitutions to public keys - an introduction to cryptography
01h 02mFrom Basic Idea to Impact: the story of modern cryptography
52mMore Secrets of Cryptography
32mCybersecurity in Post Quantum Era