Exploring Secret Keys in Searching Integral Distinguishers Based on Division Property
Exploring Secret Keys in Searching Integral Distinguishers Based on Division Property
复制标题
探索基于除法性质搜索整数可区分符的秘密
DOI：
10.13154/tosc.v2020.i3.288-304
复制
发表时间：
2020-09
影响因子：
3.5
通讯作者：
Shi Tairong
中科院分区：
文献类型：
--
作者：
Wang Senpeng;Hu Bin;Guan Jie;Zhang Kai;Shi Tairong
Todo在2015年的EUROWITCH PT上提出的除法性质是一个广义积分性质。然后，Todo和Morii在FSE 2016上提出了传统的基于位的除法属性（CBDP）和使用三个子集的基于位的除法属性（BDPT）。在ASIACRYPT 2016上，Xiang等人扩展了混合整数线性规划（MILP）方法来搜索基于CBDP的积分区分器。在ASIACRYPT 2019上，Wang等人提出了一种基于BDPT的MILP辅助搜索积分算子的方法。BDPT算法在搜索整数密码子方面有很强的性能，但其搜索精度并不理想，对于块大小仅为32位的分组密码SPECK 32，我们可以在实验中观察到固定密钥下所有明文的行为。通过对210个随机密钥的测试，我们在实验上找到了一个较好的6轮SPECK 32的积分周期。但这种实验积分的可积性不能用现有的方法证明。为了弥补这一差距，本文对基于BDPT的整数搜索算法中的密钥问题进行了研究。我们提出了一种可以绕过“与密钥异或”操作的情况。基于新的BDPT传播规则，提出了一种改进的积分算子自动搜索算法。对于SPECK 32，我们的改进算法可以找到230个选择的明文的6轮积分矩阵。填补了理论计算与实验测量之间的差距。并将改进的方法应用于SPECK、KATAN/KTANTAN、SIMON、SIMEK、SIMON（102）、PRESENT和矩形分组密码的整数解的搜索。用改进的方法得到的积分算子优于或与已有的最长算子一致。
Division property proposed by Todo at EUROCRYPT 2015 is a generalized integral property. Then, conventional bit-based division property (CBDP) and bitbased division property using three subsets (BDPT) were proposed by Todo and Morii at FSE 2016. At ASIACRYPT 2016, Xiang et al. extended Mixed Integer Linear Programming (MILP) method to search integral distinguishers based on CBDP. And at ASIACRYPT 2019, Wang et al. proposed an MILP-aided method of searching integral distinguishers based on BDPT. Although BDPT is powerful in searching integral distinguishers, the accuracy is not perfect.For block cipher SPECK32, as the block size is only 32 bits, we can experimentally observe the behaviors of all the plaintexts under a fixed key. By testing 210 random secret keys, we experimentally find a better integral distinguisher of 6-round SPECK32 with 30 active bits. But this experimental integral distinguisher cannot be proved by existing methods. So there still exists a gap between the proved distinguisher and the experimental one.To fill the gap, we explore secret keys in searching integral distinguishers based on BDPT. We put forward a situation where “Xor with The Secret Key” operation can be bypassed. Based on the new BDPT propagation rule, an improved automatic algorithm of searching integral distinguishers is proposed. For SPECK32, our improved algorithm can find the 6-round integral distinguisher with 230 chosen plaintexts. The gap between the proved distinguisher and the experimental one is filled. Moreover, we apply this improved method to search the integral distinguishers of SPECK, KATAN/KTANTAN, SIMON, SIMECK, SIMON(102), PRESENT and RECTANGLE block ciphers. The integral distinguishers found by our improved method are better than or consistent with the previous longest distinguishers.
登录
查看更多内容
影响因子：
3.7
作者：
Yonglin Hao;Takanori Isobe;Lin Jiao;Chaoyun Li;W. Meier;Yosuke Todo;Qingju Wang
通讯作者：
Yonglin Hao;Takanori Isobe;Lin Jiao;Chaoyun Li;W. Meier;Yosuke Todo;Qingju Wang
DOI：
10.1007/978-3-662-46800-5_12
发表时间：
2015-04
期刊：
--
影响因子：
--
作者：
Yosuke Todo
通讯作者：
Yosuke Todo
影响因子：
3
作者：
Yonglin Hao;G. Leander;W. Meier;Yosuke Todo;Qingju Wang
通讯作者：
Yonglin Hao;G. Leander;W. Meier;Yosuke Todo;Qingju Wang
DOI：
10.1007/978-3-319-13039-2_9
发表时间：
2014-12
期刊：
--
影响因子：
--
作者：
Qingju Wang;Zhiqiang Liu;Kerem Varici;Yu Sasaki;V. Rijmen;Yosuke Todo
通讯作者：
Qingju Wang;Zhiqiang Liu;Kerem Varici;Yu Sasaki;V. Rijmen;Yosuke Todo
改进了对 Rijndael 的积分攻击
影响因子：
1.1
作者：
Li, Yan-Jun;Wu, Wen-Ling
通讯作者：
Wu, Wen-Ling