Finding state-of-the-art non-cryptographic hashes with Genetic Programming

14Citations
Citations of this article
26Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The design of non-cryptographic hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this paper, we use the Genetic Programming paradigm to evolve collision free and fast hash functions. For achieving robustness against collision we use a fitness function based on a non-linearity concept, producing evolved hashes with a good degree of Avalanche Effect. The other main issue, efficiency, is assured by using only very fast operators (both in hardware and software) and by limiting the number of nodes. Using this approach, we have created a new hash function, which we call gp-hash, that is able to outperform a set of five human-generated, widely-used hash functions. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Estébanez, C., Hernández-Castro, J. C., Ribagorda, A., & Isasi, P. (2006). Finding state-of-the-art non-cryptographic hashes with Genetic Programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4193 LNCS, pp. 818–827). Springer Verlag. https://doi.org/10.1007/11844297_83

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free