Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

Tight Time-Space Lower Bounds for Finding Multiple Collision Pairs and Their Applications

TheIACR via YouTube

Overview

AI, Data Science & Cloud Certificates from Google, IBM & Meta — 50% Off
One plan covers every Professional Certificate on Coursera. 50% off Coursera Plus Annual for 10 days only — price increases June 17.
Unlock All Certificates
Explore a comprehensive analysis of tight time-space lower bounds for finding multiple collision pairs and their applications in this 24-minute conference talk presented at Eurocrypt 2020. Delve into the intricacies of the birthday problem and its generalization, parallel collision search techniques, and double encryption. Examine the proof intuition behind the results and discover practical applications in cryptography. Learn about post-filtering algorithms and their role in breaking double encryption schemes. Gain valuable insights into this cutting-edge research that bridges theoretical foundations with real-world cryptographic challenges.

Syllabus

Introduction
Birthday Problem
Generalization
Parallel Collision Search
Double Encryption
Applications
Results
Proof
Proof Intuition
Application
Algorithms
Post Filtering
Breaking Double Encryption
Conclusion

Taught by

TheIACR

Reviews

Start your review of Tight Time-Space Lower Bounds for Finding Multiple Collision Pairs and Their Applications

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.