Title
On Universal Classes of Extremely Random Constant-Time Hash Functions
Abstract
A family of functions F that map [0,m-1] into [0,n-1] is said to be $\h$-wise independent if any tuple of $\h$ distinct points in $[0,m-1]$ have a corresponding image, for a randomly selected $f\in F$, that is uniformly distributed in $[0,n-1]^{\h}$. This paper shows that for suitably fixed $\epsilon
Year
DOI
Venue
2004
10.1137/S0097539701386216
SIAM J. Comput.
Keywords
Field
DocType
distinct point,functions f,universal classes,extremely random constant-time hash,corresponding image,hash function,hash functions,hashing
Graph theory,Sublinear function,Discrete mathematics,Combinatorics,Tuple,Tabulation hashing,Hash function,Mathematics,Pseudorandom number generator,Random function,Random access
Journal
Volume
Issue
ISSN
33
3
0097-5397
Citations 
PageRank 
References 
46
1.76
0
Authors
1
Name
Order
Citations
PageRank
Alan Siegel135747.50