Public Key Cryptography: Diffie-Hellman Key Exchange

Diffie-Hellman key exchange was one of the earliest practical implementations of key exchange within the field of cryptography. It relies on the discrete logarithm problem. This test clip will be part of the final chapter of Gambling with Secrets!

• Category

  Education

[Erwin Villejo]

How did you simplify 16^54 into 3^(24*54)? I don't think 3^24 = 16.

[ArtOfTheProblem]

I make this clear in the finished version, click on the annotation at the beginning of this video.

[hellyeahff]

why weren't you my high school math teacher?? bravo!

[Harsh Alkutkar]

You explained in five minutes what my teacher explained in two weeks. Thanks :)

[bbelt2d]

I finally understand! Thanks

[Rijo Abraham]

cant understand a thing he said. 0_o

[vaper192]

this is good for people who are new to cryptology good job

[Adam Smith]

but you also say 'the reverse procedure is hard' well I would argue it is impossible because 3^20 mod 17 gives the same answer as 3^5 mod 17, so x could be 20 OR 5?

[Adam Smith]

This is what I don't get, you say 'when raised to different exponents the solutions distributes uniformly around the clock', but 3^20 mod 17 gives the same answer as 3^5 mod 17, so it isn't a 1 to 1 mapping of values, so it would be impossible to derive the exact answer of x, just a set of values for x!?!????

[dm0rs]

That's really interesting. Thank you!

[paresh masani]

Thank you very much. You made my day!