强通用字符串哈希是快速的
Strongly universal string hashing is fast
摘要:
我们提出了快速强通用字符串哈希家族:它们可以以每字节0.2 CPU周期的速率处理数据。也许令人惊讶的是,我们发现这些家族-尽管它们需要大量的随机数缓冲区-通常比理论保证较弱的流行哈希函数更快。此外,传统观点认为乘法次数较少的哈希函数速度更快。然而,我们发现,他们可能无法更快,由于操作流水线。我们目前的实验结果在几个处理器,包括低功耗的处理器。我们的测试包括为具有无进位乘法(CLMUL)指令集的处理器设计的散列函数。我们还证明,使用可访问的证据,我们的家庭的强大的普遍性。
英文摘要:
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 require 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 low-powered processors. Our tests include hash functions designed for processors with the Carry-Less Multiplication (CLMUL) instruction set. We also prove, using accessible proofs, the strong universality of our families.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。