From the course: Symmetric Cryptography Essential Training
Unlock this course with a free trial
Join today to access over 25,500 courses taught by industry experts.
Diffie–Hellman key exchange
From the course: Symmetric Cryptography Essential Training
Diffie–Hellman key exchange
- [Instructor] Now that we know that calculating the discrete logarithm is difficult, let's take a look at a method for exchanging keys whose strength relies on this difficulty. It's called the Diffie-Hellman, or DH, Key Exchange. It was published in 1976 by its inventors, Whitfield Diffie and Martin Hellman. It's one of the first instances of asymmetric or public key cryptography and represents a significantly different approach to cryptography than what I've described previously in this course. This remains a very common method for keys to be exchanged on the internet today. And if it's not exactly Diffie-Hellman, your browser is doing something that looks quite similar to this. Let's get into it. Suppose Alice and Bob are friends, but live in different cities and have some messages that they want to securely send to one another. With this message, they can agree on a shared secret that we'll call S. First, they have to agree on two values which are shared publicly, a modulus m and…
Contents
-
-
-
-
-
-
-
-
(Locked)
Exchanging keys1m 34s
-
(Locked)
Key length and large numbers4m 26s
-
(Locked)
The importance of randomness to cryptography2m 26s
-
(Locked)
Modular arithmetic2m 46s
-
(Locked)
Diffie–Hellman key exchange2m 29s
-
(Locked)
Challenge: Implementing Diffie–Hellman2m 5s
-
(Locked)
Solution: Implementing Diffie–Hellman1m 17s
-
(Locked)
-