February 1, 2024
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.