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 concept of perfect secrecy, including the entropy of the secret key and the Diffie-Hellman system. It explains the necessary conditions for perfect secrecy, with detailed proofs and examples. The instructor discusses the use of one-time pads, the challenges of achieving perfect secrecy in practice, and the key generation process in the Diffie-Hellman system.