基于混沌的Hash函数的安全性分析  

CRYPTANALYSIS OF HASH FUNCTIONS BASED ON CHAOTIC SYSTEM

作　　者：谭雪[1] 周琥[1] 王世红[1] Tan Xue;Zhou Hu;Wang Shihong(School o f Science, Beijing University o f Posts and Telecommunications, Beijing 100876,China)

机构地区：[1]北京邮电大学理学院,北京100876

出　　处：《计算机应用与软件》2016年第6期320-324,共5页Computer Applications and Software

摘　　要：随着现代密码学的发展,Hash函数算法越来越占有重要的地位。针对基于耦合映像格子的并行Hash函数算法和带密钥的基于动态查找表的串行Hash函数算法进行了安全性分析。对于前者,发现耦合映像格子系统导致算法中存在一种结构缺陷,在分组序号和分组消息满足特定约束关系的条件下,无需复杂的计算可以直接给出特定分组和消息的中间Hash值。对于后者,分析了产生碰撞缓存器状态的约束条件。在此条件下,找到算法的输出碰撞的代价为O(2^(100)),远大于生日攻击的代价。With the development of modern cryptology, hash functions play an increasingly important role. In this paper, we analyse the security of two hash algorithms, one is a parallel hash function construction based on coupled map lattice, the other is the keyed serial hash function based on a dynamic lookup table. For the former, we find that the coupled map lattice leads to a structural defect in the algorithm.Under the condition of block index and block message meeting specific constraint, without the complicated computation it is able to directly give the intermediate hash value of the specific block index and block message. For the latter, we analyse the constraint condition of the state of a buffer that the collision is produced. Under this condition, the cost of output collisions of the algorithm found is 0 (2100) , much higher than that of the birthday attack.

关 键 词：HASH函数 混沌 碰撞 安全性分析 

分 类 号：TP399[自动化与计算机技术—计算机应用技术]