Google 發表了三個 Hash 演算法的實作：「New algorithms may lower the cost of secure computing」。
Our first hash function produces the same output as SipHash, but 1.5 times as quickly thanks to AVX-2 instructions.
第二個是 SipHash 的改良版，但輸出不同 (所以不是 SipHash)，但速度比 SipHash 更快：
The second improvement uses j-lanes tree hashing to process multiple inputs in parallel, which is 3 times as fast. This technique is known to be secure, but produces different output than the original SipHash and is slightly slower for short inputs.
HighwayHash is based on a new way of mixing inputs with just a few AVX-2 multiply and permute instructions. We are hopeful that the result is a cryptographically strong pseudorandom function, but new cryptanalysis methods might be needed for analyzing this promising family of hash functions. HighwayHash is significantly faster than SipHash for all measured input sizes, with about 7 times higher throughput at 1 KiB.