2004•Information Security and CryptologyRequires access
Analysis of hash functions based on cellular automata
Ki-Tae Jeong, Jesang Lee, Donghoon Chang, Jaechul Sung, Sangjin Lee
Open publisher page 0 citations
Abstract
A hash function is a function that takes bit strings of arbitrary length to bit string of fixed length. A cellular automata is a finite state machine and has the property of generating pseudorandom numbers efficiently by combinational logics of neighbour cells. In [1] and [7], hash functions based on cellular automata which can be implemented efficiently in hardware were proposed. In this paper, we show that we can find collisions of these hash functions with probability 0.46875 and 0.5 respectively.