Skip to content
💥

Hash Collision Finder

Developer

Find matching truncated SHA-1 or SHA-256 prefixes to demonstrate the birthday paradox.

0
0
This birthday-paradox demonstration finds matching truncated hash prefixes. It does not search for full-length collisions or break SHA-256. SHA-1 and MD5 have known collision weaknesses and should not be used where collision resistance is required.
Settings

MD5 is not offered - the browser's Web Crypto API (crypto.subtle.digest) does not support it. Only algorithms it genuinely supports (SHA-1, SHA-256) are used here.

Search for matching truncated SHA-1 or SHA-256 prefixes, with a limit of 100,000 attempts. This demonstrates the birthday paradox; it does not find full-length hash collisions or break either algorithm.

See more about the Hash Collision Finder

Key features

  • Clean interface
  • Fast processing
  • No signup required
  • Works offline

Related Blog Posts

Quick answers for Hash Collision Finder

What does this tool support?
Search for matching truncated SHA-1 or SHA-256 prefixes, with a limit of 100,000 attempts. This demonstrates the birthday paradox; it does not find full-length hash collisions or break either algorithm.