Efficient Dissection of Composite Problems, with Applications
Offered By: TheIACR via YouTube
Course Description
Overview
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.
Syllabus
Efficient Dissection of Composite Problems, with Applica ...
Taught by
TheIACR
Related Courses
Information TheoryThe Chinese University of Hong Kong via Coursera Intro to Computer Science
University of Virginia via Udacity Analytic Combinatorics, Part I
Princeton University via Coursera Algorithms, Part I
Princeton University via Coursera Divide and Conquer, Sorting and Searching, and Randomized Algorithms
Stanford University via Coursera