hn.today

Collisions in Hash Functions

collisions.zksecurity.xyz5 points0 comments
Screenshot of Collisions in Hash Functions

This is an interactive catalog of 123 pairs of distinct inputs that produce the same hash digest. Its central point is that a collision is directly checkable: hash both inputs and compare the results, rather than relying only on a paper’s estimate of how difficult an attack might be. The catalog distinguishes 15 collisions that break complete hash functions under standard settings from 108 that apply only to weakened or modified versions. Full breaks include MD4, MD5, original RIPEMD, SHA-0, SHA-1, and certain HAVAL configurations. The SHA-256, SHA-512, SHA-3, RIPEMD-128, RIPEMD-160, and SM3 examples do not break those full hash functions. Users can explore how each pair’s bytes differ and how the collision works.

The catalog defines a full break precisely: both inputs must collide with all rounds, the standard initial state, normal padding, and the complete output. A collision requiring a chosen starting state does not qualify, even if it covers every round; nor does a collision demonstrate a preimage attack. Each entry must include both published inputs, specify the exact function and settings, and pass independent verification. The accompanying Python tool runs the checks, using locally implemented hash functions validated against test vectors and Python’s hashlib for full MD5 and SHA-1. Most examples work offline; two PDFs needed for the original SHA-1 collision can be downloaded and checked. The collection is a research tool, not an exhaustive list, and its 123 entries are not 123 independent attacks.

Read on collisions.zksecurity.xyz0 comments on Hacker News

Summary generated by AI from the linked article. hn.today is not affiliated with Hacker News or Y Combinator.

More in Security

The daily digest

Today's best Hacker News stories, summarized and screenshotted, one email a day.