对ARIA算法的不可能飞去来攻击

Impossible Boomerang Attack of ARIA

构造了ARIA算法的4轮不可能飞去来区分器,首次给出5轮ARIA算法和6轮ARIA-192/256算法的不可能飞去来攻击。与飞去来攻击相比,对5轮ARIA算法的不可能飞去来攻击需要2107.9个选择明文和2107.9次5轮ARIA加密,数据和时间复杂度均优于飞去来攻击;对6轮ARIA算法的不可能飞去来攻击需要2116.5个选择明文和2137.4次6轮ARIA加密,数据复杂度优于飞去来攻击。

A 4-round impossible boomerang distinguisher of ARIA is constructed; the impossible boomerang attacks （IBA） of 5-round ARIA and 6-round ARIA-192/256 are presented. Compared with boomerang attack, IBA of 5-round ARIA needs 2107.9 chosen plaintexts and 2107.9 5-round ARIA encryptions, with advantages in data and time complexities; IBA of 6-round ARIA-192/256 needs 2116.5 chosen plaintexts and 2137.4 6-round ARIA encryptions, with advantage in data complexity.