Evolving Universal Hash Functions Using Genetic Algorithms

In this paper we explore using genetic algorithms to construct universal hash functions to efficiently hash a given set of keys. The hash function generated in this way should give minimum number of collisions. The algorithm has less computational complexity and can be used in scenarios where the input distribution of keys is changing and the hash function needs to be modified often to rehash the values.