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 philosopher is like a man fasting in the midst of universal intoxication. He alone perceives the illusion of which all creatures are the willing playthings; he is less duped than his neighbor by his own nature. He judges more sanely, he sees things as they are. It is in this that his liberty consists—in the ability to see clearly and soberly, in the power of mental record.”
—Henri-Frédéric Amiel (1821–1881)