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 basics of Diffie-Hellman cryptography, including algorithms for big numbers, the ring of residues modulo n, orders in a group, monoids, and the Diffie-Hellman key agreement protocol. It explains how to perform addition and multiplication with big numbers, define a monoid, and use the Double-and-Add algorithm. The lecture also introduces the concept of square-and-multiply in the context of cryptographic operations.