论文部分内容阅读
为了设计安全的分组密码算法,评估算法抵抗差分分析和线性分析的能力至关重要。目前一个比较实际的方法就是计算分组算法活动S盒的最小数目,或者最小数目的下界。2004年Shirai等人在FSE会议上提出了一种基于汉明重量针对Feistel结构的估计差分活动S盒数量下界的算法。本文指出了此算法的不足,并基于一种特殊的剪枝策略,对原算法提出了一个改进方案,将算法提升到实际应用水平。
In order to design a secure block cipher algorithm, it is crucial to evaluate the ability of the algorithm to resist differential analysis and linear analysis. A practical method is to calculate the minimum number of S-boxes in the grouping algorithm, or the minimum number of lower bounds. In 2004, Shirai et al. Proposed an algorithm for estimating the lower bound of the number of differential S-boxes based on Hamming weight for the Feistel structure at the FSE meeting. This paper points out the shortcomings of this algorithm, and based on a special pruning strategy, an improved scheme is proposed for the original algorithm, which improves the algorithm to the practical level.