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:
“For universal love is as special an aspect as carnal love or any of the other kinds: all forms of mental and spiritual activity must be practiced and encouraged equally if the whole affair is to prosper. There is no cutting corners where the life of the soul is concerned....”
—John Ashbery (b. 1927)