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 semantic security in stream ciphers, focusing on pseudorandom number generators, expansion, and pseudorandomness conditions. It also discusses the implementation of stream ciphers with secret keys and the computational limitations faced by cryptanalysts. The instructor presents examples related to integer factorization and computational security assumptions, emphasizing the importance of intractability assumptions in cryptography.