3 ms·
It's not "strong", it's "strongly universal", which is a well defined mathematical property. Universal hash functions are the basis of MAC part of popular authe
by CodesInChaos 8y ago
It's not "strong", it's "strongly universal", which is a well defined mathematical property. Universal hash functions are the basis of MAC part of popular authenticated encryption algorithms, like GCM and ChaCha-Poly1305 (though for this purpose 128-bit tags are preferred).
Though I don't see what the point of this particular implementation is, with its hardcoded keys and fixed 64-bit inputs instead of a random secret key and variable length inputs.
- stochastic_monk 8y agoBecause it’s hashing an item of fixed size. This is specialized for 32 or 64-bit integers. clhash supports arbitrary length strings. There is a performance cost for that generality. For example, in my experiments, clhash is 1/3 as fast as murmurhash or Wang’s 64-bit hash for 64-bit integers.