How We Created the First SHA-1 Collision and What it Means for Hash Security

How We Created the First SHA-1 Collision and What it Means for Hash Security

Black Hat via YouTube Direct link

Making efficient use of GPUs

19 of 29

19 of 29

Making efficient use of GPUs

Class Central Classrooms beta

YouTube playlists curated by Class Central.

Classroom Contents

How We Created the First SHA-1 Collision and What it Means for Hash Security

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 What is a cryptographic hash function?
  3. 3 What are secure hash functions used for?
  4. 4 Second preimage attack
  5. 5 The need for cryptanalysis
  6. 6 The Merkle-Damgård construction
  7. 7 Unrolled SHA-1 compress function
  8. 8 SHA-1 cryptanalysis in a nutshell
  9. 9 Two block collision
  10. 10 Fixed prefix attack (SHA-1)
  11. 11 Carefully choosing prefix to improve attack
  12. 12 Chosen-prefix: MDS SSL certificate forgery
  13. 13 Malware MD5 certificate
  14. 14 Attack feasibility
  15. 15 Attack overview
  16. 16 Smart prefix: JPEG embedded in PDF
  17. 17 Scaling computation
  18. 18 Developing the full collision attack
  19. 19 Making efficient use of GPUs
  20. 20 Phase 2 production rate per step
  21. 21 Computational cost comparison
  22. 22 Counter-cryptanalysis to the rescue!
  23. 23 GIT is using SHA-1 for foreseeable future
  24. 24 Mitigating GIT issues with counter-cryptanalysis
  25. 25 Google scans incoming documents
  26. 26 Why scan files for collision?
  27. 27 Gmail counter-cryptanalysis cost
  28. 28 The future of hash security is diversity
  29. 29 Takeaways

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.