https://hackerpaper.kaipfister.de/p/1202.4961/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=9456040urn:hackerpapers:mention:1202.4961:9456040Wed, 29 Apr 2015 01:15:30 GMT<p>Turns out that only clmul is needed to produce fast hash functions, even strongly universal ones. http://arxiv.org/abs/1202.4961</p><p><a href="https://hackerpaper.kaipfister.de/p/1202.4961/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DBhttps://news.ycombinator.com/item?id=3624419urn:hackerpapers:mention:1202.4961:3624419Thu, 23 Feb 2012 10:07:56 GMT<p>The paper is available -&gt; http://arxiv.org/abs/1202.4961 &quot;&quot;&quot;We present fast strongly universal string hashing families: they can process data at a rate of 0.2 CPU cycle per byte. Maybe surprisingly, we find that these families---though they requires a large buffer of random numbers---are often faster than popular hash functions with weaker theoretical guarantees. Moreover, conventional wisdom is that hash functions with fewer multiplications are faster. Yet we find that they may fail to be faster due to operation pipelining. We present experimental results on several processors including…</p><p><a href="https://hackerpaper.kaipfister.de/p/1202.4961/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.DB