A New (n, 2n) Double Block Length Hash Function Based on Single Key Scheduling

A New (n, 2n) Double Block Length Hash Function Based on Single Key Scheduling
复制标题

DOI:
10.1109/aina.2015.237
复制
发表时间:
2015-03
期刊:
2015 IEEE 29th International Conference on Advanced Information Networking and Applications
影响因子:
--
通讯作者:
A. Miyaji;M. Rashed
A. Miyaji;M. Rashed
中科院分区:
其他
文献类型:
--
作者:
A. Miyaji;M. Rashed

文献摘要

相似文献

在本文中,我们提出了一个双块长度哈希函数称为MR-MMO。我们的方案满足(n,2n)分组密码的两个调用,并且可以将3 n比特压缩到2n比特(n = 128比特)。MR-MMO的碰撞电阻(CR)和原像电阻(PR)分别为2126.70和2252.5。令人惊讶的是,我们的方案的碰撞安全界是最好的,与其他现有的计划。我们对每个压缩函数使用单个密钥调度,这在成本和时间方面都很重要。另外,可以说Weimar-DM、Tandem-DM、Hirose-DM的证明技术是基于理想密码模型(ICM)的,而我们使用的是弱密码模型(WCM)工具。以上方案均采用Davies Meyer(DM)模式,我们还采用了Matyas Meyer Oseas(MMO)模式。同样明显的是,我们的方案的证明技术是非常简单,直接和容易理解的。
In this paper we propose a double block length hash function called MR-MMO. Our scheme satisfies two calls of (n, 2n) block cipher and can compress 3n bits to 2n bits (n = 128 bits). The Collision Resistance (CR) and Preimage Resistance (PR) of MR-MMO are respectively 2126.70 and 2252.5. Surprisingly, the collision security bound of our scheme is the best in compare with other existing schemes. We use a single key scheduling for each compression function which is great in respect of cost and time. Additionally, it can be said that the proof technique of Weimar-DM, Tandem-DM, Hirose-DM are based on Ideal Cipher Model (ICM) while we use Weak Cipher Model (WCM) tool. Davies Meyer (DM) mode is used in the above all schemes, we also made a change using Matyas Meyer Oseas (MMO) mode. It is also obvious that the proof technique of our scheme is very simple, straightforward and easy to understand.