Collision Atlas

3 min read Original article ↗

About the atlas

What counts as a collision here

Full break means a collision in the full hash: all rounds, the standard starting state, normal padding and the complete output. It demonstrates broken collision resistance; it does not claim a preimage attack. A full-height bar alone is not enough: the 80-step SHA-1 chosen-IV example is still only a compression-function collision.

To get in, a pair has to

  • Be published in full. A paper that says a collision exists, or estimates what one would cost, doesn't count. We need both inputs.
  • Say exactly which function it breaks: how many rounds, which starting state, what padding, how long the output is.
  • Survive our own code. We hash both inputs ourselves and compare. If the inputs turn out to be identical, or the digest is off by a bit, the pair is out.

What this does not mean

  • The SHA-256, SHA-512, SHA-3, RIPEMD-128, RIPEMD-160 and SM3 pairs here use weakened versions. Full collision breaks here cover MD4, MD5, HAVAL with 3 or 4 passes, the original RIPEMD, SHA-0 and SHA-1.
  • The Keccak Crunchy entries are contest puzzles with a 160-bit capacity. They are not SHA3-256 and not Ethereum's Keccak-256. The SHA-3 and SHAKE entries stop after 3 to 5 of 24 rounds.
  • A pair that needs a hand-picked starting state is not a hash collision, because a real hash doesn't let you pick. That goes for the SHA-1 pair that covers all 80 steps, too.
  • 123 pairs is not 123 attacks. Many are one attack at several round counts, or one collision cut down to a prefix.

Don't take our word for it

$ python3 -m atlas list
$ python3 -m atlas verify --fetch
$ python3 -m unittest discover -s tests -v

You need Python 3.10 and nothing else. Run these from the repository root.

--fetch downloads two PDFs, the original SHA-1 collision, about 825 KiB, and checks their SHA-256 before using them. Everything else is in the repository as hex and runs offline. Leave the flag off and the run fails on the missing files. It never skips them quietly.

We wrote the hash functions ourselves from the specifications and tested each against published test vectors. There is no other way to run SHA-256 for 31 steps instead of 64. Full MD5 and SHA-1 use Python's hashlib. We never run code that came with an attack.

This is a research tool from zkSecurity, not a service. If a collision isn't listed here, that doesn't mean it doesn't exist.