arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1209.4255cs.CR
收藏

无记忆的近碰撞,再访

Memoryless Near-Collisions, Revisited

Mario Lamberger, Elmar Teufl

摘要:

本文讨论了在无记忆的情况下,密码散列函数的类碰撞问题。一种常见的方法是截断散列函数的几个输出位,并查找此修改后的函数的冲突。在最近的两篇论文中,介绍了这种方法的增强,它是基于经典的循环查找技术和覆盖码。本文研究了无记忆近碰撞问题的两个方面。首先,我们给出了一个完整的处理截断比特的数目和基于截断的方法的成功概率之间的权衡。其次,我们证明了循环查找方法的局限性,发现近碰撞的情况下,相反的碰撞,一个无记忆的变体不能匹配的查询复杂性的“内存满”生日般的近碰撞查找方法。

英文摘要:

In this paper we discuss the problem of generically finding near-collisions for cryptographic hash functions in a memoryless way. A common approach is to truncate several output bits of the hash function and to look for collisions of this modified function. In two recent papers, an enhancement to this approach was introduced which is based on classical cycle-finding techniques and covering codes. This paper investigates two aspects of the problem of memoryless near-collisions. Firstly, we give a full treatment of the trade-off between the number of truncated bits and the success-probability of the truncation based approach. Secondly, we demonstrate the limits of cycle-finding methods for finding near-collisions by showing that, opposed to the collision case, a memoryless variant cannot match the query-complexity of the "memory-full" birthday-like near-collision finding method.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑