HalftimeHash：没有64位乘法器或有限域的现代哈希
HalftimeHash: Modern Hashing without 64-bit Multipliers or Finite Fields
摘要：
HalftimeHash是一种新的长字符串哈希算法。目标是减少冲突（不同的输入产生相同的输出哈希值）和高性能。与长字符串上最快的通用哈希函数（clhash和UMASH）相比，HalftimeHash降低了冲突概率，同时还将性能提高了50%以上，每个周期超过16字节。此外，HalftimeHash不使用任何可能限制其可移植性的扩展64位乘法或任何有限域算法。
英文摘要：
HalftimeHash is a new algorithm for hashing long strings. The goals are few collisions (different inputs that produce identical output hash values) and high performance. Compared to the fastest universal hash functions on long strings (clhash and UMASH) HalftimeHash decreases collision probability while also increasing performance by over 50%, exceeding 16 bytes per cycle. In addition, HalftimeHash does not use any widening 64-bit multiplications or any finite field arithmetic that could limit its portability.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
