首页|期刊导航|密码学报(中英文)|搜索最优差分和线性迹的高效方法:应用于NOEKEON和Serpent算法

搜索最优差分和线性迹的高效方法:应用于NOEKEON和Serpent算法OA

Efficient Approach for Searching the Best Differential and Linear Trail:Applications to NOEKEON and Serpent

中文摘要英文摘要

抵御差分分析和线性分析的能力是评估对称密码算法安全性的两个核心指标.目前,已有多种自动化搜索工具可用于寻找密码算法的最优差分迹和最优线性迹.然而,当应用于线性层包含异或操作的密码算法时,这些工具通常效率不高或通用性不足.为解决这一问题,本文提出一种针对此类分组密码的高效通用搜索工具.通过记忆化迭代搜索策略,改进了基于搜索模式的Matsui算法.该策略充分利用了先前的搜索结果,显著减少了重复计算.整个搜索过程被划分为两个阶段:扩展搜索模式阶段和两轮模式搜索阶段.在扩展搜索模式阶段,利用密码的线性层性质和稳定掩码技术,加快了剪枝过程.在两轮模式搜索阶段,采用最窄点技术以减小初始搜索空间,并结合差分模式和线性掩码模式,进一步提升算法效率.应用改进后的工具评估NOEKEON和Serpent算法,均给出它们在差分分析和线性分析下最紧的安全界.对于NOEKEON算法,成功获得了至多9轮最优差分迹和至多16轮(全轮)最优线性迹.特别地,首次得到一个可用于差分攻击的概率为2-126的8轮最优差分迹.对于Serpent算法,获得了至多5轮最优差分迹和至多9轮最优线性迹,并首次证明了10轮Serpent的最大差分概率上界为2-129,以及12轮Serpent的最大线性相关性上界为2-68.

The ability to resist differential cryptanalysis and linear cryptanalysis serves as two core metrics for evaluating the security of symmetric-key primitives.A variety of automated search tools are available for searching the best differential and linear trails for primitives.Nevertheless,these tools often exhibit inefficiency or lack generality when applied to primitives with linear layers that incorporate XOR operations.To address this problem,this study proposes an efficient and general search tool specifically designed to deal with such primitives.The Matsui's algorithm based on search patterns is enhanced by employing a memorized iterative search strategy,which significantly reduces redundant computations by effectively leveraging previous search results.The entire search process is divided into two phases:the extension of search patterns phase and the search for two-round search patterns phase.In the extension of search patterns phase,the pruning process is accelerated by leveraging the property of the linear layers of ciphers and introducing stability mask technique.In the search for two-round search patterns phase,the narrowest point technique is employed to reduce the initial search space,further enhancing the efficiency of the algorithm by integrating difference patterns and linear mask patterns.Applying the improved tool to two SPN primitives NOEKEON and Serpent,their tightest security bounds against differential and linear cryptanalysis are provided.For NOEKEON,the best differential trails up to 9 rounds and the best linear trails up to 16(full)rounds are obtained.In particular,for the first time,an 8-round best differential trail with a probability of 2-126 suitable for differential attack is identified.For Serpent,the best differential trails up to 5 rounds and the best linear trails up to 9 rounds are obtained.It is proved for the first time that the upper bound of the maximum differential probability for 10-round Serpent is 2-129,and the upper bound of the maximum linear correlation for 12-round Serpent is 2-68.

翁菁穗;张文涛;彭婷

中国科学院信息工程研究所网络空间安全防御重点实验室,北京 100085||中国科学院大学网络空间安全学院,北京 100049中国科学院信息工程研究所网络空间安全防御重点实验室,北京 100085||中国科学院大学网络空间安全学院,北京 100049中国科学院信息工程研究所网络空间安全防御重点实验室,北京 100085||中国科学院大学网络空间安全学院,北京 100049

信息技术与安全科学

差分分析线性分析自动化搜索NOEKEON算法Serpent算法

differential cryptanalysislinear cryptanalysisautomatic searchNOEKEONSerpent

《密码学报(中英文)》 2026 (1)

80-96,17

中国科学院稳定支持基础研究领域青年团队计划(YSBR-035)国家自然科学基金(61379138)Chinese Academy of Sciences(CAS)Project for Young Scientists in Basic Research(YSBR-035)Na-tional Natural Science Foundation of China(61379138)

10.13868/j.cnki.jcr.000839

评论