Cryptographic perfect hash functions: A theoretical analysis on space efficiency, time complexity, and entropy
We analyze a theoretical perfect hash function that has three desirable properties: (1) it is a cryptographic hash function; (2) its in-place encoding obtains the theoretical lower-bound for the expected space complexity; and (3) its in-place encoding is a random bit string with maximum entropy.
Discussion & Related
Algebraic Hashing: Composable Hash Functions Through XOR
A C++ library for composable hash functions using algebraic structure over XOR, with template metaprogramming.
November 1, 2022 · 2 min read
Perfect Hashing: Space Bounds, Entropy, and Cryptographic Security
Space bounds, entropy requirements, and cryptographic security properties of perfect hash functions.
February 1, 2024 · 2 min read