Using universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain mathematical property (see definition below). This guarantees a low number of collisions in expectation, even if the data is chosen by an adversary. Many universal families are known (for hashing integers, vectors, strings), and their evaluation is often very efficient. Universal hashing has numerous uses in computer science, for example in implementations of hash tables, randomized algorithms, and cryptography.
Read more about Universal Hashing: Introduction, Mathematical Guarantees, Constructions
Famous quotes containing the word universal:
“To revolutionize, at one effort, the universal world of human thought, human opinion, and human sentiment.... All that he has to do is to write and publish a very little book. Its title should be simple—a few plain words—”My Heart Laid Bare.” But—this little book must be true to its title.”
—Edgar Allan Poe (1809–1849)