Fast universal hashing with small keys and no preprocessing: the PolyR construction

Fast universal hashing with small keys and no preprocessing: the PolyR construction (2000)

by Ted Krovetz , Phillip Rogaway

Citations:

8 - 1 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Fast universal hashing with small keys and no preprocessing: the PolyR construction	user correction - Legacy Corrections
AUTHOR NAME	Ted Krovetz	user correction - Legacy Corrections
AUTHOR NAME	Phillip Rogaway	user correction - Legacy Corrections
ABSTRACT	We describe a universal hash-function family, PolyR, which hashes messages of effectively arbitrary lengths in 3.9--6.9 cycles/byte (cpb) on a Pentium II (achieving a collision probability in the range 2 -16 --2 -50 ). Unlike most proposals, PolyR actually hashes short messages faster (per byte) than long ones. At the same time, its key is only a few bytes, the output is only a few bytes, and no "preprocessing" is needed to achieve maximal effciency. Our designs have been strongly influenced by low-level considerations relevant to software speed, and experimental results are given throughout.	user correction - Legacy Corrections
YEAR	2000	user correction - Legacy Corrections
CITATIONS	12 found	ParsCit 1.0