Asymmetric Encryption: A Deep Dive
summary
Explains RSA with a worked example using 323 = 17 × 19, computing λ(323)=144, e=5 and d=29 to show encryption/decryption; builds elliptic-curve group over mod 11 with 10 curve points plus infinity and a generator G of order 11; demonstrates Shor’s order-finding breaks integer factorization and discrete logs so RSA and ECDSA become insecure; surveys post‑quantum replacements CRYSTALS Kyber (KEM) and Dilithium (signatures), hybrid x25519+Kyber deployments and practical obstacles like TLS packetization and hardware token constraints.
AI-written summary · about
chapters (8)
- 0:00Asymmetric encryption intro
- 5:45Cryptography history basics
- 10:50RSA encryption explained
- 20:12Group theory for crypto
- 26:11Elliptic curve crypto deep dive
- 40:37Quantum computing breaking crypto
- 50:03Post-quantum crypto future
- 57:05Q&A
related talks
52mAsymmetric Encryption: A Deep Dive
40mAsymmetric Encryption: A Deep Dive
56mAsymmetric Encryption: A Deep Dive
46mFrom substitutions to public keys - an introduction to cryptography
01h 26mTLS Cryptography for Programmers
15mRSA encryption in 10 minutes
01h 00mCS Fundamentals: Why SSL and SSH are Secure
58mKeynote: Crypto means Cryptography!