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
Beyond Worst-Case Analysis - Panel DiscussionSimons Institute via YouTube Reinforcement Learning - Part I
Simons Institute via YouTube Reinforcement Learning in Feature Space: Complexity and Regret
Simons Institute via YouTube Exploration with Limited Memory - Streaming Algorithms for Coin Tossing, Noisy Comparisons, and Multi-Armed Bandits
Association for Computing Machinery (ACM) via YouTube Optimal Transport for Machine Learning - Gabriel Peyre, Ecole Normale Superieure
Alan Turing Institute via YouTube