Hash function construction based on coupled map lattice for communication security

Hash functions are the most important component for communication security protocols. Based on coupled map lattice together with traditional Merkle-Damgard iterated structure, a new hash function OCMLHash construction was proposed. Through defining a new float point number storage presentation and corresponding basic operations, the proposed construction can complete chaos operation and output hash value on 32-bit word using basic operations such as shifter, adder etc. Compared with the existing chaotic hash functions, this construction cuts down time expansion on data type transformation between unsigned integers and float point numbers, and avoids the possibility of hashing the same message to different hash value in different computation environments. The study results show that the hash function has properties of irreversibility, pseudo collision resistance and sensitivity to initial values. The algorithm can be processed in parallel and it is simple to be realized.