Hash Function based on Cellular Automata

In the design of an efficient Hash function,it is required that the Hash function must have fairly good confusion,diffuse,low collision,and high-speed implementation as well.This paper proposes a cellular automata-based Hash function,which adopts rule 90 cellular automata with binary tree state transition as the iteration function of the Hash.Simulation results indicate that this method has the characteristics of good confusion,diffuse and low collision,including the advantages of high-speed implementation.