RSA encryption in 10 minutes
summary
Explains RSA as math not implementation and walks a concrete toy example showing it works numerically using small primes and modular arithmetic Euler's theorem gives the correctness claim and factorization gives the security claim Uses P=5, Q=11, N=55 then e=3, M=42 -> C=3 shows finding d=27 and C^d mod N = 42 so encryption and decryption succeed and security relies on difficulty of factoring PQ
AI-written summary · about
chapters (8)
- 0:00Introduction
- 2:30Why RSA matters
- 4:00History of public key crypto
- 6:29Defining RSA mechanics
- 7:52Modulo arithmetic basics
- 10:28Encryption steps
- 11:56Decryption explained
- 14:01Security and prime factors
related talks
40mAsymmetric Encryption: A Deep Dive
52mAsymmetric Encryption: A Deep Dive
29mHow Prime Numbers Keep the Internet Secure
56mAsymmetric Encryption: A Deep Dive
58mAsymmetric Encryption: A Deep Dive
01h 00mCS Fundamentals: Why SSL and SSH are Secure
48mRSA is Dead. Long Live BB84!
01h 26mTLS Cryptography for Programmers