One-Way Hash Function Construction Based on Chaotic Message Expansion

In order to overcome the defects of the existing Hash algorithm,a novel Hash algorithm based on chaotic message expansion was proposed.This algorithm combines the advantages of a chaotic system and conventional one-way Hash function,follows the traditional Merkle-Damgrd construction and compression function,and uses the chaotic map network to carry out the message expansion to further impact on the Hash process.Compared with the existing chaotic Hash functions,the proposed algorithm inherits the efficiency of the conventional Hash functions and improves the security.Theoretical and experimental results show that the proposed Hash algorithm possesses a good one-way property,a high avalanche effect and a strong collision resistance,as required by practical Hash functions,so it is easy to implement in parallel.