Open access research
publication repository

Faster 64-bit universal hashing using carry-less multiplications [r-libre/681]

Lemire, Daniel, & Kaser, Owen (2016). Faster 64-bit universal hashing using carry-less multiplications. Journal of Cryptographic Engineering, 6 (3), 171-185. https://doi.org/10.1007/s13389-015-0110-5

File(s) available for this item:
[img]  PDF (Version de l'auteur) - 1503.03465v6.pdf
License : Creative Commons Attribution.
Item Type: Journal Articles
Refereed: Yes
Status: Published
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.
Official URL: https://link.springer.com/article/10.1007/s13389-01...
Depositor: Lemire, Daniel
Owner / Manager: Daniel Lemire
Deposited: 17 Aug 2015 13:23
Last Modified: 05 Aug 2016 13:57

Actions (login required)