Sequential Hashing with Minimum Padding
Sequential Hashing with Minimum Padding
复制标题
DOI：
10.3390/cryptography2020011
复制
发表时间：
2018-06
期刊：
影响因子：
--
通讯作者：
Shoichi Hirose
中科院分区：
文献类型：
--
作者：
Shoichi Hirose
本文提出了一个顺序域扩展方案，使用压缩函数进行散列的最小填充。所提出的域扩展方案不受长度扩展性质的限制。哈希函数使用建议的域扩展的碰撞阻力被证明是减少到碰撞阻力和无处不在的原像阻力的基本压缩功能在标准模型中，其中的压缩功能被假定为随机选择从一个功能的家庭在一些有效的方式。它的不可微性从一个随机预言的生日界也显示在假设的基础上的压缩功能是一个固定的输入长度的随机预言或Davies-Meyer模式的块密码均匀随机选择。建议的域扩展也适用于海绵建设和由此产生的哈希函数被证明是不可微的从一个随机预言的生日界在理想的置换模型。所提出的域扩展方案预计将是有用的处理短消息。
This article presents a sequential domain extension scheme with minimum padding for hashing using a compression function. The proposed domain extension scheme is free from the length extension property. The collision resistance of a hash function using the proposed domain extension is shown to be reduced to the collision resistance and the everywhere preimage resistance of the underlying compression function in the standard model, where the compression function is assumed to be chosen at random from a function family in some efficient way. Its indifferentiability from a random oracle up to the birthday bound is also shown on the assumption that the underlying compression function is a fixed-input-length random oracle or the Davies-Meyer mode of a block cipher chosen uniformly at random. The proposed domain extension is also applied to the sponge construction and the resultant hash function is shown to be indifferentiable from a random oracle up to the birthday bound in the ideal permutation model. The proposed domain extension scheme is expected to be useful for processing short messages.