Buy Me a Coffee at ko-fi.com

Universal hashing

selection of a hash function at random from a family of hash functions with a certain mathematical property, guaranteeing a low number of collisions in expectation, even if the data is chosen by an adversary

Pronunciation
/ˌjunəˈvərsəl ˈhæʃɪŋ/
/juːnɪˈvəːsəl haʃiŋ/
Categories