基于整数混沌帐篷网的并行Hash函数设计.docVIP

  Parallel hash function using DM-based integer-valued chaotic maps network# Liao Dong, Wang Xiaomin 5 10 15 (School of Information Science and Technology, Southwest Jiaotong University, ChengDu 610031) Abstract: A parallel hash function using DM-based integer-valued chaotic maps network is proposed which combines the advantage of both chaotic system and DM scheme. And the algorithm has avoided the flaw of the forgery attack of the exiting parallel hash functions. The algorithm can be used to calculate hash values of 128, 160, 192, 256, 384 and 512 bits with little difference in performance for the different hash values. The message is partitioned into message blocks with fixed length and each message block is processed by the integer-valued chaotic maps network in parallel. The final hash value is generated with a sponge-like construction， which confuses the mixed result of all the outputs of the integer-valued chaotic maps network. The hash function is mainly implemented by extend integer-valued tent maps and can work in a parallel mode, which guarantees good security and high efficiency. Theoretical and simulation results show that the proposed hash algorithm has strong diffusion and confusion capability and good collision resistance. These properties make it a good candidate for hash on platforms that support parallel processing. Keywords: Chaotic system; hash function; parallel; sponge-like construction 20 0 Introduction Hash function is a fundamental building of information security and plays an important role in data integrity protection, message authentication and digital signature. The traditional hash functions, such as MD4, MD5, SHA-1, PIPEMD, were proved to be secure for quite a long time. 25 30 35 40 Moreover, Wang and her research term efficiently found collisions using modular differential attack in MD5, SHA-1, and HAVAL-128[1,2,3] in 2005, the security of the traditional hash functions were extremely threatened. At the same time, it is intere