Maths or magic? End-to-end encryption explained like I'm five
summary
Live demonstration shows a hand‑built end‑to‑end scheme using a public interactive implementation of Diffie‑Hellman key exchange, with a concrete math walkthrough (g=2, a=5, b=6, p=10 produces shared key 6) and a colors analogy for private/public mixes. The talk contrasts Caesar/ROT13 demo with modern cryptography, explains AES as the symmetric cipher replacing DES, stresses per‑message key rotation, and flags quantum computing as a real threat to brute‑force timelines. Audience participation and simple JS‑style math prove the protocol works as advertised.
AI-written summary · about
chapters (12)
- 0:00Start
- 1:21Why do we need end-to-end encryption?
- 5:29What is encryption anyway?
- 6:09How does the Caesar Cipher work?
- 7:06Trivia question
- 8:59Why is Caesar Cipher weak?
- 9:50A good algorithm
- 13:55Let's make the communication secure
- 15:29The Diffie-Hellman algorithm
- 18:00Generate the private and public keys
- 18:46Exchange the public keys
- 18:59Generate the shared keys
related talks
23mMaths or magic End to end encryption explained with art
56mAsymmetric Encryption: A Deep Dive
46mFrom substitutions to public keys - an introduction to cryptography
40mAsymmetric Encryption: A Deep Dive
40mEnd-to-end encryption: Behind the scenes
01h 02mFrom Basic Idea to Impact: the story of modern cryptography
42mEverything I always wanted to know about crypto
58mKeynote: Crypto means Cryptography!