密码学报（中英文）2025，Vol.12Issue(5)：1047-1060,14.DOI:10.13868/j.cnki.jcr.000812
PRESENT算法抗积分区分器的安全界
Security Bound of PRESENT Against Integral Distinguishers
摘要
Abstract
At ASIACRYPT 2021,Hebborn et al.developed a theory for block ciphers against integral distinguishers and provided a method to derive the security bound against integral distinguishers,i.e.,constructing a full-rank integral-resistance matrix.Under the assumption of independent round keys,they proved that 13 rounds and higher of PRESENT has no integral distinguisher,while the best known integral distinguisher of PRESENT only reaches 9 rounds so far.This indicates a large gap between actual integral distinguishers and the theoretical security bound for PRESENT.This study works on the security bound of PRESENT against integral distinguishers.Firstly,a new strategy is proposed for constructing the integral-resistance matrix,that is,a specific form of the integral-resistance matrix given by a diagonal matrix made up of several small matrices.Secondly,a new method for searching key patterns is given,with which we can quickly identify the corresponding key patterns which ensure that each small matrix has full rank.Finally,using these full-rank small matrices,a full-rank integral-resistance matrix is obtained for 11-round PRESENT.Thus,it is demonstrated that there is no integral distinguisher for 11 rounds and more of PRESENT under the assumption of independent round keys.关键词
PRESENT/积分区分器/积分抵抗矩阵/可分性Key words
PRESENT/integral distinguisher/integral-resistance matrix/division property分类
计算机与自动化引用本文复制引用
曾凡洋,田甜..PRESENT算法抗积分区分器的安全界[J].密码学报（中英文）,2025,12(5):1047-1060,14.基金项目
国家自然科学基金(62372464)National Natural Science Foundation of China(62372464) （62372464）
