Universal hashing

Universal hashing is a concept in computer science that deals with designing hash functions that minimize the probability of collision between different inputs. A hash function is a function that takes an input (or "key") and produces a fixed-size string of bytes. The output is typically a numerical value (a hash code), which is used in various applications such as data structures (like hash tables), cryptography, and data integrity checks.