一种基于混沌的可并行Hash函数

A Parallel Hash Function Based on Chaos

本文针对文献[4,5]中基于混沌的Hash构造算法的缺陷,提出一种新的算法。该算法在保证安全性的前提下,具有适合并行实现及最终Hash值对明文信息敏感依赖的均匀性等显著的优点。理论分析和仿真实验证明该算法可以满足Hash函数的各项性能要求。

In this paper, a novel hash algorithm based on chaos is proposed to overcome the flaws of the corresponding algorithms in [4, 5]. Its security can be guaranteed, and it can work efficiently in a parallel way. Furthermore, the algorithm structure can ensure the uniform sensitivity of final hash value to the message blocks at different positions of the whole message. Theoretical analysis and computer simulation indicate that the proposed algorithm can satisfy the performance requirements of hash function.