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:
“The hero is a mind of such balance that no disturbances can shake his will, but pleasantly, and, as it were, merrily, he advances to his own music, alike in frightful alarms and in the tipsy mirth of universal dissoluteness.”
—Ralph Waldo Emerson (1803–1882)