Explore a cryptographic talk from CRYPTO 2012 that delves into efficient methods for dissecting composite problems and their applications. Learn from authors Itai Dinur, Orr Dunkelman, Nathan Keller, and Adi Shamir as they present their research findings in this 23-minute presentation. Gain insights into advanced cryptographic techniques and their potential impact on problem-solving in the field of cryptography.
Efficient Dissection of Composite Problems, with Applications
Overview
Syllabus
Efficient Dissection of Composite Problems, with Applica ...
Taught by
TheIACR
Related Courses
-
Memory Efficient Algorithms for Finding Needles in Haystacks
-
Collision Attacks on Up to 5 Rounds of SHA-3 Using Generalized Internal Differentials
-
An Optimal Distributed Discrete Log Protocol with Applications to Homomorphic Secret Sharing
-
Dissection BKW
-
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
-
Lower Bounds on Lattice Enumeration with Extreme Pruning
