Explore a groundbreaking presentation from Crypto 2017 on the first collision for full SHA-1. Delve into the research by Marc Stevens, Elie Bursztein, Pierre Karpman, Ange Albertini, and Yarik Markov as they discuss the state of cryptographic hash functions. Learn about SHA-1 compression, the novel approach using systems of equations, and the implementation of GPU-accelerated computation. Discover the comparison between GPU and CPU performance, and gain insights into Google's infrastructure used for this project. Understand the concept of reusable collisions and their implications for cryptographic security. This 29-minute talk provides a comprehensive overview of a significant advancement in cryptanalysis, essential for anyone interested in cybersecurity and cryptography.
Overview
Syllabus
Intro
What is SHA1
MD5 Collisions
State of the art
SHA1 compression
Approach SS
System of Equations
Overview
GeoCA
GPU
GPU vs CPU
Google Infrastructure
Reusable collision
Taught by
TheIACR