Hash Functions

Entropy Maps: When Hashing Meets Information Theory

A conceptual introduction to entropy maps—implementing functions with hash functions and prefix-free codes.

Hash-Based Bernoulli Constructions: Space-Optimal Probabilistic Data Structures

Algebraic Hashing A Modern C++20 Library for Composable Hash Functions Version 2.0

Cryptographic perfect hash functions: A theoretical analysis on space efficiency, time complexity, and entropy

maph: Maps Based on Perfect Hashing for Sub-Microsecond Key-Value Storage

The Beautiful Deception: How 256 Bits Pretend to be Infinity

How do you store infinity in 256 bits? An exploration of the fundamental deception at the heart of cryptography: using finite information to simulate infinite randomness.

Perfect Hashing: Space Bounds, Entropy, and Cryptographic Security

What if a perfect hash function could simultaneously be: (1) cryptographically secure, (2) space-optimal, and (3) maximum-entropy encoded? This paper proves such a construction exists—and analyzes exactly what you sacrifice to get all three.

The …

The Beautiful Deception: How 256 Bits Pretend to be Infinity

Algebraic Hashing: Composable Hash Functions Through XOR

Most hash libraries treat hash functions as black boxes. Algebraic Hashing exposes their mathematical structure, letting you compose hash functions like algebraic expressions—with zero runtime overhead.

The Core Insight

Hash functions form an abelian …