对简化轮数的SNAKE(2)算法的碰撞攻击

Collision Attack on Reduced-round SNAKE(2)

为了研究简化轮数的SNAKE(2)算法抵抗碰撞攻击的能力,根据算法的一个等价结构,给出了SNAKE(2)算法的一个6轮区分器。通过在此区分器前后加适当的轮数,对7/8/9轮的SNAKE(2)算法实施了攻击。其攻击的数据复杂度依次为O(26)、O(26.52)、O(215),时间复杂度依次为O(29.05)、O(218.32)、O(226.42),攻击结果优于对SNAKE(2)算法的Square攻击。

Abstract In order to research the ability of SNAKE（2） algorithm against the collision attack,a 6-round distinguisher of SNAKE（2） algorithm based on an equivalent structure of it was proposed. Attacks on 7/8/9 rounds of SNAKE（2） were performed by adding proper rounds before or after the 6-round distinguisher. The data complexities areO（2^6 ）, O（2^6. 52）, O（2^15）, and the time complexities are O（2^9. 05）, O（2^18. 32）, O（2^26. 42 ）. The results are better than that of Square attack.