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.
翻译:半时Hash 是一种用于散列长字符串的新算法。 目标是很少的碰撞( 产生相同输出散列值的不同投入) 和高性能。 与长字符串( 千兆赫和UMAS) 上最快的通用散列函数相比, 半时Hash 降低碰撞概率, 同时提高50%以上, 超过每周期16 字节。 此外, 半时Hash 不使用任何扩大的64位乘数或任何限制其可移动性的有限字段算术。