… of a class of functions: universal 2. We show that any class of functions that is universal 2
has the property that given any sample, a randomly chosen member of that class will be …

… We will be using the following universal class of hash functions: Let p be prime, U =- {0, 1,...
,p - 1} the universe. Consider two parameters: d >_ 1, the degree and s >_ 1, the table size. …

In this paper we use linear algebraic methods to analyze the performance of several classes
of hash functions, including the class H 2 presented by Carter and Wegman [2]. Suppose H …

… , so that a negligible percentage of the hash functions might be seriously … hash function (ie,
a randomly selected member of a universal class of pairwise independent hash functions) for …

… The Universal Class (without ϵ specified) defined above has proportion ϵ = 1/m, and … -Universal”.
In our derivation of properties, we will consider the more general ϵ-Universal classes …

… In section 1 we strengthen the notion of a universal2 set of hash functions to strongly …
universal classes of hash functions are fairly large. If the functions in one of these classes can hash …

… ingly direct contradiction to the definition of the universal class studied, choice of P > A in …
of hash function performance that is separated from the performance of the hashing system; …

… In this paper we consider the bit-security of two types of universal hash functions: linear
functions on GF[2”] and linear functions on the integers modulo a prime. We show individual …

… -n-wise-independent hash functions that can be evaluated in … one important family of hash
functions. An explicit algorithm for … is that double hashing using these universal functions has (…

… characterizations of universal classes of hash functions in … The two classes of hash functions
that we study are called … We show that optimally universal classes of hash functions are …