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 basis of world peace is the teaching which runs through almost all the great religions of the world. “Love thy neighbor as thyself.” Christ, some of the other great Jewish teachers, Buddha, all preached it. Their followers forgot it. What is the trouble between capital and labor, what is the trouble in many of our communities, but rather a universal forgetting that this teaching is one of our first obligations.”
—Eleanor Roosevelt (1884–1962)