Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture covers the Diffie-Hellman key exchange protocol, the concept of orders in a group, the Z_p field, and the challenges posed by the Discrete Logarithm Problem. It also discusses the computational Diffie-Hellman problem, the Decisional Diffie-Hellman problem, and the implications of hardness depending on the properties of groups.