Faster 64-bit universal hashing using carry-less multiplications
arXiv:1503.03465 · doi:10.1007/s13389-015-0110-5
Abstract
Intel and AMD support the Carry-less Multiplication (CLMUL) instruction set in their x64 processors. We use CLMUL to implement an almost universal 64-bit hash family (CLHASH). We compare this new family with what might be the fastest almost universal family on x64 processors (VHASH). We find that CLHASH is at least 60% faster. We also compare CLHASH with a popular hash function designed for speed (Google's CityHash). We find that CLHASH is 40% faster than CityHash on inputs larger than 64 bytes and just as fast otherwise.
Cited by in corpus (7)
- Parsing Gigabytes of JSON per Second
- Proteus: A Self-Designing Range Filter
- SecuCode: Intrinsic PUF Entangled Secure Wireless Code Dissemination for Computational RFID Devices
- Multiplying boolean Polynomials with Frobenius Partitions in Additive Fast Fourier Transform
- Regular and almost universal hashing: an efficient implementation
- Adaptive Cuckoo Filters
- Accelerating Quantum State Encoding with SIMD: Design, Implementation, and Benchmarking