CRDec 19, 2016

Fast keyed hash/pseudo-random function using SIMD multiply and permute

arXiv:1612.06257v311 citationsHas Code
Originality Incremental advance
AI Analysis

This addresses the need for faster hashing in applications like file checksums and stream ciphers, though it is incremental as it builds on existing SIMD techniques.

The authors tackled the problem of slow pseudo-random hashing by introducing HighwayHash, a new function based on SIMD multiply and permute instructions, achieving a 5.2 times speedup over SipHash for 1 KiB inputs.

HighwayHash is a new pseudo-random function based on SIMD multiply and permute instructions for thorough and fast hashing. It is 5.2 times as fast as SipHash for 1 KiB inputs. An open-source implementation is available under a permissive license. We discuss design choices and provide statistical analysis, speed measurements and preliminary cryptanalysis. Assuming it withstands further analysis, strengthened variants may also substantially accelerate file checksums and stream ciphers.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes