Algebraic Degree Estimation of Block Ciphers Using Randomized Algorithm; Upper-Bound Integral Distinguisher

IF 0.5 4区计算机科学 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS

International Journal of Cooperative Information Systems Pub Date : 2016-12-30 DOI:10.5121/IJCIS.2016.6402

Haruhisa Kosuge, Hidema Tanaka

{"title":"Algebraic Degree Estimation of Block Ciphers Using Randomized Algorithm; Upper-Bound Integral Distinguisher","authors":"Haruhisa Kosuge, Hidema Tanaka","doi":"10.5121/IJCIS.2016.6402","DOIUrl":null,"url":null,"abstract":"Integral attack is a powerful method to recover the secret key of block cipher by exploiting a characteristic that a set of outputs after several rounds encryption has ( integral distinguisher). Recently, Todo proposed a new algorithm to construct integral distinguisher with division property. However, the existence of integral distinguisher which holds in additional rounds can not be denied by the algorithm. On the contrary, we take an approach to obtain the number of rounds which integral distinguisher does not hold ( upper-bound integral distinguisher). The approach is based on algebraic degree estimation. We execute a random search for a term which has a degree equals the number of all inputted variables. We propose an algorithm and apply it to PRESENT and RECTANGLE. Then, we confirm that there exists no 8-round integral distinguisher in PRESENT and no 9-round integral distinguisher in RECTANGLE. From the facts, integral attack for more than 11-round and 13-round of PRESENT and RECTANGLE is infeasible, respectively.","PeriodicalId":54966,"journal":{"name":"International Journal of Cooperative Information Systems","volume":"6 1","pages":"09-29"},"PeriodicalIF":0.5000,"publicationDate":"2016-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Cooperative Information Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.5121/IJCIS.2016.6402","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}

引用次数: 0

Abstract

Integral attack is a powerful method to recover the secret key of block cipher by exploiting a characteristic that a set of outputs after several rounds encryption has ( integral distinguisher). Recently, Todo proposed a new algorithm to construct integral distinguisher with division property. However, the existence of integral distinguisher which holds in additional rounds can not be denied by the algorithm. On the contrary, we take an approach to obtain the number of rounds which integral distinguisher does not hold ( upper-bound integral distinguisher). The approach is based on algebraic degree estimation. We execute a random search for a term which has a degree equals the number of all inputted variables. We propose an algorithm and apply it to PRESENT and RECTANGLE. Then, we confirm that there exists no 8-round integral distinguisher in PRESENT and no 9-round integral distinguisher in RECTANGLE. From the facts, integral attack for more than 11-round and 13-round of PRESENT and RECTANGLE is infeasible, respectively.

查看原文本刊更多论文

基于随机化算法的分组密码代数度估计上界积分区分符

积分攻击是利用分组密码经过几轮加密后的一组输出所具有的特征(积分区分符)来恢复分组密码密钥的一种有效方法。最近，Todo提出了一种构造具有除法性质的积分区分符的新算法。然而，该算法不能否认在附加轮中存在整数区分符。相反，我们采用了一种方法来获得不存在积分区分符的轮数(上界积分区分符)。该方法基于代数度估计。我们执行一个随机搜索，它的度数等于所有输入变量的个数。我们提出了一种算法，并将其应用于PRESENT和RECTANGLE。然后，我们证实了在PRESENT中不存在8轮积分区分符，在RECTANGLE中不存在9轮积分区分符。从事实来看，积分攻击对于11轮以上的PRESENT和13轮以上的RECTANGLE都是不可行的。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

International Journal of Cooperative Information Systems 工程技术-计算机：信息系统

CiteScore

2.30

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： The paradigm for the next generation of information systems (ISs) will involve large numbers of ISs distributed over large, complex computer/communication networks. Such ISs will manage or have access to large amounts of information and computing services and will interoperate as required. These support individual or collaborative human work. Communication among component systems will be done using protocols that range from conventional ones to those based on distributed AI. We call such next generation ISs Cooperative Information Systems (CIS). The International Journal of Cooperative Information Systems (IJCIS) addresses the intricacies of cooperative work in the framework of distributed interoperable information systems. It provides a forum for the presentation and dissemination of research covering all aspects of CIS design, requirements, functionality, implementation, deployment, and evolution.