Lecture

Cryptographic Security Fundamentals

Description

This lecture covers the fundamentals of cryptographic security, including topics such as bruteforce collision search algorithms, selecting security parameters, public-key cryptography, and the Diffie-Hellman key exchange. The instructor explains the birthday paradox, collision search complexity, and provides examples of birthday attacks on EMAC. The lecture delves into memoryless collision search, cycle detection algorithms, and the risks of underestimating collision attacks. It also discusses generic attacks against symmetric encryption and hash functions, as well as the importance of security parameters in breaking symmetric cryptography. Furthermore, the lecture explores dedicated primitives, reductions, and references in the field of cryptographic security.

About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.