基于Luffa杂凑函数的旋转攻击

Rotational attack on Luffa hash function

针对Luffa杂凑函数抗旋转攻击的能力进行了研究,通过分析Luffa置换的特点,定义了针对Luffa置换的旋转对,给出了基本字变换对旋转关系的影响,证明了"与"和"或"运算对旋转关系影响的等效性,提出了缩减轮Luffa置换与随机置换的区分算法。理论分析和实验结果均表明,3轮Luffa置换难以抵抗旋转攻击,攻击的计算复杂度仅为216。

This paper studied the capacity of resisting rotational attack of Luffa hash function. Through analyzing characteristics of Luffa permutation, it defined the rotational pair of Luffa permutation, gave the influence of basic word transformations to rotational relation, proved that the AND operation and the OR operation had the same influence on rotational relation, and presented the distinguisher algorithm between round-reduced Luffa permutation and a random permutation. Theoretical analysis and experiment results show that 3 round Luffa permutation can＇ t resist rotational attack and the attack complexity is only 2^16.