Strongly Universal String Hashing is Fast - 15 May 2014 (1202.49...

Strongly universal string hashing is fastDaniel Lemire1∗ and Owen Kaser21LICEF Research Center, TELUQ, Université du Québec, Canada 2Department of CSAS, University of New Brunswick, CanadaEmail: lemire@gmail.comWe 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 theoretica