Description
Universal hashing of bytes.
Description
Taken together, universal hash functions and a good source of entropy provide a foundation for hash maps guarantee O(1) lookups even if an adversary chooses the keys. This library implements such a hash map. The implementation of lookup is tuned for performance. The functions for building hash maps are not since they are intended to be called infrequently.