Evolutionary hash functions for specific domains

摘要: Abstract Hash functions are a key component of many essential applications, ranging from compilers, databases or internet browsers to videogames network devices. The same reduced set extensively used and have become “standard de facto” since they provide very efficient results in searches over unsorted sets. However, depending on the characteristics data being hashed, overall performance these non-cryptographic hash can vary dramatically, becoming common source loss. difficult design, extremely non-linear counter-intuitive, relationships among variables often intricate obscure. Surprisingly, little scientific research is devoted design experimental assessment widely functions. In this work, addition performing an up-to-date comparison state-of-the-art functions, we propose use evolutionary techniques for designing “ad hoc” Thus, genetic programming will be automatically tailor-made function that continuously evolved if needed, so it always adapted real-world dynamic environments. To validate proposed approach, compared several quality metrics generated most across eight different scenarios. outperformed those cases tested.