Abstract

This paper explores the use of genetic algorithms for the generation of hash functions. We define a custom Turing-complete assembly language to represent our generated functions. Good hash functions have high collision resistance, a uniformly-distributed range, and calculate rapidly. We evaluate fitness primarily from collision-resistance. We test uniform output distribution only intermittently due to the length and expense of the randomness tests. Speed is guaranteed by a hard maximum cycle limit.