DocumentCode
2750051
Title
Evolving Universal Hash Functions Using Genetic Algorithms
Author
Safdari, Mustafa ; Joshi, Ramprasad
Author_Institution
Comput. Sci. & Inf. Syst. Group, BITS, Pilani, India
fYear
2009
fDate
3-5 April 2009
Firstpage
84
Lastpage
87
Abstract
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.
Keywords
computational complexity; cryptography; genetic algorithms; computational complexity; genetic algorithm; key distribution; universal hash function; Biological cells; Computational complexity; Computer science; Genetic algorithms; Information systems; Genetic Algorithms; Key Distribution; Universal Hash Functions;
fLanguage
English
Publisher
ieee
Conference_Titel
Future Computer and Communication, 2009. ICFCC 2009. International Conference on
Conference_Location
Kuala Lumpar
Print_ISBN
978-0-7695-3591-3
Type
conf
DOI
10.1109/ICFCC.2009.66
Filename
5189747
Link To Document