On the Indifferentiability of Fugue and Luffa
On the Indifferentiability of Fugue and Luffa
复制标题
论赋格与丝瓜的不可区分性
DOI：
10.1007/978-3-642-21554-4_28
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
Avradip Mandal
中科院分区：
文献类型：
--
作者：
Rishiraj Bhattacharyya;Avradip Mandal
目前，不可微性被认为是加密哈希函数在不同安全证明中实例化随机预言的重要安全概念。在本文中，我们证明了两个 SHA3 第二轮候选者 Fugue 和 Luffa 的不可微性。我们还分析了修改后的 Luffa 模式用单个大排列替换多个小排列的不可微性。
我们的技术非常通用，可以适用于任何使用仿射函数进行消息插入的基于海绵的设计。据我们所知，我们对 Luffa 的结果是基于可变（超过两个）数量的小排列的操作模式的第一个不可微分分析。
Indifferentiability is currently considered to be an important security notion for a cryptographic hash function to instantiate Random Oracles in different security proofs. In this paper, we prove indifferentiability of Fugue and Luffa, two SHA3 second round candidates. We also analyze the indifferentiability of a modified Luffa mode replacing multiple small permutations by a single large permutation.
Our technique is quite general and can be applicable to any sponge based design which uses affine function for message insertion. To the best of our knowledge, our result for Luffa is the first indifferentiability analysis of a mode of operation based on variable (more than two) number of small permutations.