LeMac - A fast AES-based universal hash function and MAC.
-
Updated
Nov 27, 2025 - Zig
LeMac - A fast AES-based universal hash function and MAC.
simple hash functions in go: a simple hash function implementing Horner's rule and a universal hash function implementing the Carter-Wegman method.
Implementation of a perfect hashing data structure. We say a hash function is perfect for S if all lookups involve O(1) work.
Hazz, a pseudo-random-data-filled-table, to generate k indipendent and uniform, very fast hash functions.
Asino a stubborn, simple and fast Bloom filter for the rest of us.
Multimixer-128: Universal Keyed Hashing Based on Integer Multiplication
Merge Sort-Insertion Sort-Heap Sort- Hash Table algorithms are included in these projects.
Impelementation for some Perfect hashing algorithms
PolymurHash port in Zig.
Hash functions and tables in Java
Implementation of a perfect hashing data structure using different space complexity solutions.
Different algorithms and data structures implementations.
Implementing an English Dictionary as application on perfect hashing.
Add a description, image, and links to the universal-hashing topic page so that developers can more easily learn about it.
To associate your repository with the universal-hashing topic, visit your repo's landing page and select "manage topics."