论文部分内容阅读
提出了一个基于分组密码的hash函数体制,它的rate小于1但却具有更高的效率,同时,这个hash函数可以使用不安全的压缩函数进行构造,降低了对压缩函数安全性的要求.首先,在黑盒子模型下对这个新的体制的安全性进行了证明,然后给出了能够用于构造该体制的使用分组密码构造的压缩函数,最后通过实验对比发现,新hash函数的速度比rate为1的hash函数快得多.实验结果表明,除了rate以外,密钥编排也是影响基于分组密码hash函数效率的重要因素,甚至比rate影响更大.该体制只有两个密钥,不需要进行大量的密钥扩展运算,大大提高了基于分组密码hash函数的效率,而且该体制可以使用现有的分组密码来构造.
A hash function scheme based on block cipher is proposed. Its rate is less than 1, but it has higher efficiency. At the same time, this hash function can be constructed by using unsafe compression function, which reduces the requirement for the safety of compression function. , The security of this new system is proved under the black box model, and then the compression function constructed by using block cipher is given. Finally, the experimental comparison shows that the new hash function is faster than rate The hash function is much faster than 1. The experimental results show that in addition to the rate, the key scheduling is also an important factor affecting the efficiency of the hash function based on block cipher, and even greater than the rate of influence. The system has only two keys, do not need to be A large number of key expansion operations greatly improve the efficiency of packet-based hash functions, and the system can be constructed using existing block ciphers.