Extended integer tent maps and dynamic hash function
|更新时间:2024-10-14
|
Extended integer tent maps and dynamic hash function
Vol. 31, Issue 5, Pages: 51-59(2010)
作者机构:
北京石油化工学院信息工程学院
作者简介:
基金信息:
DOI:
CLC:TN918.1
Published:2010
稿件说明:
移动端阅览
LIU Jian-dong. Extended integer tent maps and dynamic hash function[J]. 2010, 31(5): 51-59.
DOI:
LIU Jian-dong. Extended integer tent maps and dynamic hash function[J]. 2010, 31(5): 51-59.DOI:
Extended integer tent maps and dynamic hash function
摘要
在分析扩展整数帐篷映射均匀分布特性的基础上
提出一种输出长度为160bit的动态散列函数构造方案。另外
对MD结构进行了改进
在无需扩展中间状态的情况下
提高了散列函数抵抗部分消息碰撞攻击的能力。初步的安全性测试表明
这种散列函数具有很强的安全性
且实现简单、运行速度快
是传统散列函数的一种理想的替代算法。
Abstract
Based on the analysis of uniform distribution property of the extended integer tent maps
a novel dynamic hash function with the output length of 160bit was constructed.In addition
the MD structure was improved so that the capacity of collision resistance of the middle iteration process of the hash function was enhanced without extending intermediate states.Preliminary security testing indicates that
this hash function has a high degree of security
and it can be realized easily with great rapidity.The algorithm of hash function is an ideal subsititution for traditional hash function.