Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
Offered By: TheIACR via YouTube
Course Description
Overview
Explore a cryptography talk from CRYPTO 2011 that delves into pseudorandom knapsacks and the sample complexity of Learning with Errors (LWE) search-to-decision reductions. Gain insights from authors Daniele Micciancio and Petros Mol as they present their research findings in this 38-minute presentation. Discover the intricacies of these cryptographic concepts and their implications for the field of cryptography.
Syllabus
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
Taught by
TheIACR
Related Courses
Applied CryptographyUniversity of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera