Maths or magic End to end encryption explained with art
summary
Shows why Caesar cipher is trivial: 26 shifts and frequency analysis and why public algorithms matter, then implements Diffie‑Hellman end‑to‑end key exchange using colored paints and live math. Demonstrates DH with concrete numbers (g=2, p=10, a=5, b=6 → public 2 and 4 → shared key 6), explains DH needs only two exponentiations and a modulus, recommends using AES for symmetric encryption and rotating keys, and stresses that security sits in the parameters not secrecy of the algorithm.
AI-written summary · about
chapters (12)
- 0:00Introduction and speaker background
- 1:09Why we need end-to-end encryption
- 3:16Definition and basics of encryption
- 5:47Cesar Cipher and its flaws
- 8:18Public algorithms and security
- 10:49Symmetric encryption with AES
- 11:54Key sharing problem and Diffie-Hellman
- 13:37Visualizing Diffie-Hellman with art
- 16:07Mathematical explanation of Diffie-Hellman
- 18:19Proof and practical example
- 21:19Why Diffie-Hellman works securely
- 22:22Impact of encryption on society
related talks
29mMaths or magic? End-to-end encryption explained like I'm five
46mFrom substitutions to public keys - an introduction to cryptography
40mEnd-to-end encryption: Behind the scenes
56mAsymmetric Encryption: A Deep Dive
55mThe secrets of Cryptography
42mEverything I always wanted to know about crypto
52mAsymmetric Encryption: A Deep Dive
40mAsymmetric Encryption: A Deep Dive