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:
“I had rather believe all the fables in the Legend, and the Talmud, and the Alcoran, than that this universal frame is without a Mind; and, therefore, God never wrought miracle to convince atheism, because his ordinary works convince it.”
—Francis Bacon (1561–1626)