Cryptographic Hashing & Pigeonhole Demo 🐦

DISCLAIMER: This demonstration uses truncated hashes for educational purposes to quickly visualize collisions. It does not represent real-world cryptographic vulnerability or encourage attacks. Real cryptographic hashes are vastly longer and collisions are computationally infeasible to find.

Demo Controls

First K hex chars used for slot mapping.

Live Status

Inputs Processed (M): 0

Collisions Found: 0

Unique Slots Used: 0

Attempts/Sec: 0.00

Simulation Log

Hash Slots (Pigeonholes: N=100)

Pigeonhole Principle Math

Truncation length (K): 2 hex chars

Maximum possible output space (16^K): 256

Number of Hash Slots (N): 100

Collision Possibility:

Hash Inspector

MD5: ...

SHA-1: ...

SHA-256: ...

Raw Output Status (JSON Style)

{
  "status": "Awaiting input...",
  "time": ""
}

Cryptography Education

What is a Hash Function?

A cryptographic hash function is a one-way mathematical algorithm that takes an input (or 'message') of arbitrary length and outputs a fixed-length string of bytes, typically represented as a hexadecimal number (the 'hash' or 'digest'). Key properties include:

  • Deterministic: The same input always produces the same output.
  • Pre-image Resistance (One-Way): It's computationally infeasible to reverse the process—to determine the original input from the hash output.
  • Collision Resistance: It's computationally infeasible to find two different inputs that produce the same hash output (a collision).

Hashes are used for digital signatures, password storage (never store passwords directly!), and verifying data integrity.

What is the Pigeonhole Principle?

The Pigeonhole Principle is a simple but profound concept in mathematics: if you have more items (pigeons) than containers (pigeonholes), at least one container must contain more than one item.

In cryptography, the "pigeons" are the infinite number of possible inputs (messages), and the "pigeonholes" are the finite number of possible hash outputs (the fixed-length space). Since the input space is virtually infinite and the output space is finite (e.g., 2256 for SHA-256), collisions are mathematically guaranteed to exist.

Why Do Collisions Matter?

In cryptography, finding a collision means an attacker could potentially replace an authentic message or document with a fraudulent one, yet still produce the same digital signature or integrity check. This breaks the trust model of the hash function.

  • MD5 and SHA-1 are considered cryptographically broken because methods exist to find collisions faster than brute force (2128 or 280 respectively).
  • SHA-256 remains strong because while collisions exist mathematically (Pigeonhole Principle), the time and energy required to find even one is currently infeasible (estimated to be about 2128 operations).