Parallel hash function construction based on coupled map lattices

In this paper, the parallel structure of hash function is analyzed. Then, a parallel hash function based on coupled map lattices is proposed. The message is partitioned into blocks with fixed length. The message block is firstly processed by the hash round function. The final hash value is the mixed result of all the outputs of the hash round functions. The hash round functions are mainly implemented by the coupled map lattices and can work in a parallel mode, which guarantees good security and high efficiency. Theoretic analyses and numerical simulations both show that the proposed hash algorithm possesses good statistical properties, strong collision resistance and high efficiency. These properties make it a good candidate for hash on parallel computing platform.

Research highlights► The parallel structure of hash function is analyzed. ► A parallel hash function based on coupled map lattices is proposed. ► Theoretic analyses and numerical simulations both show that the proposed hash algorithm possesses good statistical properties, strong collision resistance and high efficiency.