Efficient Dissection of Composite Problems, with Applications

Efficient Dissection of Composite Problems, with Applications

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.