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:
“Vanity, or to call it by a gentler name, the desire of admiration and applause, is, perhaps, the most universal principle of human actions.... Where that desire is wanting, we are apt to be indifferent, listless, indolent, and inert.... I will own to you, under the secrecy of confession, that my vanity has very often made me take great pains to make many a woman in love with me, if I could, for whose person I would not have given a pinch of snuff.”
—Philip Dormer Stanhope, 4th Earl Chesterfield (1694–1773)