We introduce a new technique for constructing a family of universal hash functions. At its center is a simple metaphor: to hash a string x, cast each of its words into a small number of buckets xor the contents of each bucket then collect up all the buckets' contents. Used in the context of Wegman{Carter authentication, this style of hash function provides a fast approach for software message authentication. Key words: Cryptography, Hashing, Message authentication codes, Universal Hashing.