Back to Show
Infinite Series
The Mathematics of Diffie-Hellman Key Exchange
Season 2
Episode 6
Symmetric keys are essential to encrypting messages. How can two people share the same key without someone else getting a hold of it? Upfront asymmetric encryption is one way, but another is Diffie-Hellman key exchange.
Support Provided By
8:16
The proof for Brouwer's Fixed Point Theorem uses a bridge between geometry and algebra.
6:47
Encryption isn’t really about factoring or prime numbers. What is it about?
11:19
Why is there a hexagonal structure in honeycombs? Why not squares?
14:24
The answer lies in the weirdness of floating-point numbers and the computer's perception..
12:04
The theory of social networks allows us to mathematically model and analyze..