摘要
依据ARIA的结构特性,基于Yu Sasaki和Yosuke Todo给出的4.5轮截断不可能差分路径,实现了对7轮ARIA-256的不可能差分分析,需要数据复杂度为2112和大约2217次7轮加密运算。与现有的研究成果对比,该分析在数据复杂度和时间复杂度上都有所减少。进一步研究8轮不可能差分分析,需要数据复杂度为2191和大约2319次8轮加密运算。虽然该结果超过了穷举搜索的攻击复杂度,但与已有的研究成果对比,减少了攻击复杂度。该方法改进了文献[12]的分析结果,降低了7轮攻击和8轮攻击的攻击复杂度。
According to the structural features of ARIA,based on the 4.5-rounds of truncated impossible differential path proposed by Yu Sasaki and Yosuke Todo,it realizes the impossible differential analysis of the 7-rounds ARIA-256.The data complexity is 2112,and it requires 2217 times of 7-rounds of encryption.Compared with the existing research results,it reduced data complexity and time complexity.In addition,8-rounds of impossible differential analysis was also studied.The data complexity was 2191,and it required about 2319 times of 8-rounds of encryption.Although this result exceeded the attack complexity of the exhaustive search,the data complexity and time complexity were reduced compared with the existing research results.This method improves the results of literature[12],and the attack complexity of 7-rounds and 8-rounds is reduced.
作者
欧海文
王湘南
李艳俊
雷亚超
Ou Haiwen;Wang Xiangnan;Li Yanjun;Lei Yachao(Department of Information Security,Beijing Electronics Science and Technology Institute,Beijing 100070,China;School of Telecommunication Engineering,Xidian University,Xi’an 710071,Shaanxi,China)
出处
《计算机应用与软件》
北大核心
2020年第3期292-298,309,共8页
Computer Applications and Software
