pith. sign in

arxiv: 1503.03465 · v8 · pith:FJMTTYGMnew · submitted 2015-03-11 · 💻 cs.DS · cs.PF

Faster 64-bit universal hashing using carry-less multiplications

classification 💻 cs.DS cs.PF
keywords clhashfamilyfasteruniversalalmostcarry-lesscityhashclmul
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.