{"id":"https://openalex.org/W2119251656","doi":"https://doi.org/10.1145/1570256.1570396","title":"Evolving universal hash functions using genetic algorithms","display_name":"Evolving universal hash functions using genetic algorithms","publication_year":2009,"publication_date":"2009-07-08","ids":{"openalex":"https://openalex.org/W2119251656","doi":"https://doi.org/10.1145/1570256.1570396","mag":"2119251656"},"language":"en","primary_location":{"id":"doi:10.1145/1570256.1570396","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1570256.1570396","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083927321","display_name":"Mustafa Safdari","orcid":null},"institutions":[{"id":"https://openalex.org/I74796645","display_name":"Birla Institute of Technology and Science, Pilani","ror":"https://ror.org/001p3jz28","country_code":"IN","type":"education","lineage":["https://openalex.org/I74796645"]},{"id":"https://openalex.org/I4210148827","display_name":"Birla Institute of Technology and Science, Pilani - Goa Campus","ror":"https://ror.org/046sh6j17","country_code":"IN","type":"education","lineage":["https://openalex.org/I4210148827","https://openalex.org/I74796645"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Mustafa Safdari","raw_affiliation_strings":["BITS, Pilani - Goa Campus, Zuarinagar (Goa), India"],"affiliations":[{"raw_affiliation_string":"BITS, Pilani - Goa Campus, Zuarinagar (Goa), India","institution_ids":["https://openalex.org/I74796645","https://openalex.org/I4210148827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5083927321"],"corresponding_institution_ids":["https://openalex.org/I4210148827","https://openalex.org/I74796645"],"apc_list":null,"apc_paid":null,"fwci":0.8724,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.80617348,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"2729","last_page":"2732"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9918000102043152,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9897000193595886,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11975","display_name":"Evolutionary Algorithms and Applications","score":0.9710000157356262,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.8996782898902893},{"id":"https://openalex.org/keywords/double-hashing","display_name":"Double hashing","score":0.8459432125091553},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6870440244674683},{"id":"https://openalex.org/keywords/sha-2","display_name":"SHA-2","score":0.6845682263374329},{"id":"https://openalex.org/keywords/rolling-hash","display_name":"Rolling hash","score":0.6820402145385742},{"id":"https://openalex.org/keywords/hash-chain","display_name":"Hash chain","score":0.6782622337341309},{"id":"https://openalex.org/keywords/secure-hash-algorithm","display_name":"Secure Hash Algorithm","score":0.6685848832130432},{"id":"https://openalex.org/keywords/perfect-hash-function","display_name":"Perfect hash function","score":0.5883371829986572},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5719568729400635},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.533724308013916},{"id":"https://openalex.org/keywords/hash-tree","display_name":"Hash tree","score":0.5139915347099304},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4783865213394165},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4709297716617584},{"id":"https://openalex.org/keywords/collision-resistance","display_name":"Collision resistance","score":0.45264413952827454},{"id":"https://openalex.org/keywords/universal-hashing","display_name":"Universal hashing","score":0.4415972828865051},{"id":"https://openalex.org/keywords/dynamic-perfect-hashing","display_name":"Dynamic perfect hashing","score":0.439378023147583},{"id":"https://openalex.org/keywords/swifft","display_name":"SWIFFT","score":0.4315210282802582},{"id":"https://openalex.org/keywords/security-of-cryptographic-hash-functions","display_name":"Security of cryptographic hash functions","score":0.4289027750492096},{"id":"https://openalex.org/keywords/cryptographic-hash-function","display_name":"Cryptographic hash function","score":0.38606181740760803}],"concepts":[{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.8996782898902893},{"id":"https://openalex.org/C138111711","wikidata":"https://www.wikidata.org/wiki/Q478351","display_name":"Double hashing","level":4,"score":0.8459432125091553},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6870440244674683},{"id":"https://openalex.org/C190157925","wikidata":"https://www.wikidata.org/wiki/Q1968605","display_name":"SHA-2","level":4,"score":0.6845682263374329},{"id":"https://openalex.org/C108546238","wikidata":"https://www.wikidata.org/wiki/Q4228982","display_name":"Rolling hash","level":5,"score":0.6820402145385742},{"id":"https://openalex.org/C135783594","wikidata":"https://www.wikidata.org/wiki/Q5678864","display_name":"Hash chain","level":3,"score":0.6782622337341309},{"id":"https://openalex.org/C9661340","wikidata":"https://www.wikidata.org/wiki/Q257799","display_name":"Secure Hash Algorithm","level":5,"score":0.6685848832130432},{"id":"https://openalex.org/C87431388","wikidata":"https://www.wikidata.org/wiki/Q2070573","display_name":"Perfect hash function","level":4,"score":0.5883371829986572},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5719568729400635},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.533724308013916},{"id":"https://openalex.org/C27353603","wikidata":"https://www.wikidata.org/wiki/Q16948622","display_name":"Hash tree","level":4,"score":0.5139915347099304},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4783865213394165},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4709297716617584},{"id":"https://openalex.org/C150909736","wikidata":"https://www.wikidata.org/wiki/Q1779448","display_name":"Collision resistance","level":5,"score":0.45264413952827454},{"id":"https://openalex.org/C116058348","wikidata":"https://www.wikidata.org/wiki/Q846912","display_name":"Universal hashing","level":5,"score":0.4415972828865051},{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.439378023147583},{"id":"https://openalex.org/C133358856","wikidata":"https://www.wikidata.org/wiki/Q7395188","display_name":"SWIFFT","level":5,"score":0.4315210282802582},{"id":"https://openalex.org/C165511393","wikidata":"https://www.wikidata.org/wiki/Q7252276","display_name":"Security of cryptographic hash functions","level":5,"score":0.4289027750492096},{"id":"https://openalex.org/C7608002","wikidata":"https://www.wikidata.org/wiki/Q477202","display_name":"Cryptographic hash function","level":3,"score":0.38606181740760803},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1570256.1570396","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1570256.1570396","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W1595295153","https://openalex.org/W2024759080","https://openalex.org/W2090725688","https://openalex.org/W2095008847","https://openalex.org/W2097571405","https://openalex.org/W2487334470"],"related_works":["https://openalex.org/W3201098353","https://openalex.org/W2069568684","https://openalex.org/W1985195644","https://openalex.org/W2982222368","https://openalex.org/W2332259278","https://openalex.org/W2382157040","https://openalex.org/W2951344700","https://openalex.org/W2909016198","https://openalex.org/W1987789009","https://openalex.org/W2119251656"],"abstract_inverted_index":{"In":[0],"this":[1,31,57],"paper":[2],"we":[3],"explore":[4],"the":[5,70,79,89],"use":[6],"of":[7,24,37,48,73],"metaheuristic":[8],"functions,":[9],"namely":[10],"Genetic":[11],"Algorithms":[12],"to":[13,18,41,83,87,91],"construct":[14],"Universal":[15,49],"Hash":[16,27,50],"Functions":[17,28],"efficiently":[19],"hash":[20,80],"a":[21,46],"given":[22],"set":[23],"keys.":[25],"The":[26,62],"generated":[29],"in":[30,67],"way":[32],"should":[33],"give":[34],"lesser":[35],"number":[36],"collisions":[38],"as":[39],"compared":[40],"selecting":[42],"them":[43],"randomly":[44],"from":[45],"family":[47],"Functions.":[51],"Simulations":[52],"and":[53,78],"tests":[54],"performed":[55],"using":[56],"technique":[58],"provide":[59],"promising":[60],"results.":[61],"algorithm":[63],"can":[64],"be":[65,84],"used":[66],"scenarios":[68],"where":[69],"input":[71],"distribution":[72],"keys":[74],"is":[75],"changing":[76],"frequently":[77],"function":[81],"needs":[82],"modified":[85],"often":[86],"rehash":[88],"values":[90],"reduce":[92],"collisions.":[93]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}