Speeding up detection of SHA-1 collision attacks...
summary
Describes a concrete algorithm that adds fast prechecks based on unavoidable bit conditions to avoid full SHA‑1 compression checks, shrinking the UBC set from 373 to 156 equations and expanding coverage from 14 to 32 attack classes. Expected work drops to about 0.049 disturbance vectors per 512‑bit block, giving an implemented detector that is roughly 1.6× slower than plain SHA‑1 (previously 15–224×), and is already deployed in Git, Google Drive, Gmail, GitHub and OneDrive.
AI-written summary · about
chapters (15)
- 0:00Intro
- 0:26Cryptanalytic attack mitigation
- 2:32MDS & SHA-1 collision attacks
- 3:18MDS & SHA-1 collision detection
- 5:41Improved collision detection
- 6:20SHA-1 collision detection library
- 7:31SHA-1 differential cryptanalysis
- 9:10Computing Unavoidable Bit Conditions
- 10:40SHA1 unavoidable bit conditions
- 11:18Exploiting overlapping UBCS
- 13:32UBC check algorithm
- 14:53SHA1 Collision Detection Implementation: Testing and Verification
- 15:38UBC check expected performance
- 17:03SHA1 Collision Detection Implementation: Performance
- 19:24SHA1 Collision Detection Library
related talks
41mFault Attacks & Side Channels
38mProvably Secure Virus Detection: Using the Uncertainty to End Computer Malware
40mImplementation
28mModernizing Kernel Cryptography: From Complex APIs To Streamlined Libraries
47mThreshold Signatures and Fault Attacks
07mHashing
23mSecurity Outgunned: Measuring Software Defined Attack Surface
26mBaby Sharks: Small Subgroup Attacks on DKG Implementations