Hash-Functions

Bernoulli Types: Theory and Construction

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

Cryptographic theory assumes random oracles with infinite output. We have 256 bits. This paper explores how we bridge that gap, and what it means that we can.

Perfect Hashing: Space Bounds, Entropy, and Cryptographic Security

Space bounds, entropy requirements, and cryptographic security properties of perfect hash functions.

Algebraic Hashing: Composable Hash Functions Through XOR

A C++ library for composable hash functions using algebraic structure over XOR, with template metaprogramming.

Random Oracles in Python

Three Python approximations of a random oracle, each showing a different tradeoff between true randomness, determinism, and composability.