MS-E1687 - Advanced Topics in Cryptography V D, Lecture, 8.1.2024-8.4.2024
This course space end date is set to 08.04.2024 Search Courses: MS-E1687
06 Lecture
Krav för slutförande
- "Every" computationally secure cryptographic primitive implies one-way functions." is a conceptual result proven by Impagliazzo and Luby and we discuss it in this lecture.
- Definition of computational distance
- Definition of distributional one-way functions
- Proof that the existance of two efficiently sampleable distributions with a gap between statistical and computational distance implies the existence of one-way functions.
Link to the lecture: Video
Below are lecture scribbles --- the lecture notes cover the statistical bounds.