摘要：

QARMA算法是一种代替置换网络结构的轻量级可调分组密码算法。研究QARMA算法抵抗相关密钥不可能差分攻击的能力,根据QARMA-64密钥编排的特点搜索到一个7轮相关密钥不可能差分区分器,在该差分区分器的前、后各添加3轮构成13轮相关密钥不可能差分攻击。分析结果表明,在猜测52 bit密钥时,与现有中间相遇攻击相比,该相关密钥不可能差分攻击具有攻击轮数较多、时间复杂度和空间复杂度较低的优点。

关键词: QARMA算法, 轻量级分组密码, 代替置换网络结构, 区分器, 不可能差分攻击

Abstract:

QARMA algorithm is a lightweight and adjustable block cipher algorithm with Substitution Permutation Network(SPN) structure.The ability of QARMA algorithm to resist the related-key impossible differential attack is studied.According to the characteristics of QARMA-64 key arrangement,a 7-round related-key impossible differential differentiator is searched.3 rounds are added before and after the differential differentiator to form the 13-round related-key impossible differential attack.Analysis results show that the proposed attack has more attack rounds,less time complexity and less space complexity than the existing intermediate encounter attack when guessing 52 bit key.

Key words: QARMA algorithm, lightweight block cipher, Substitution Permutation Network(SPN) structure, differentiator, impossible differential attack

中图分类号: 

• TP309