CAJ | 학술논문

为了设计安全的分组密码算法，评估算法抵抗差分分析和线性分析的能力至关重要。目前一个比较实际的方法就是计算分组算法活动S盒的最小数目，或者最小数目的下界。2004年Shirai等人在FSE会议上提出了一种基于汉明重量针对Feistel结构的估计差分活动S盒数量下界的算法。本文指出了此算法的不足，并基于一种特殊的剪枝策略，对原算法提出了一个改进方案，将算法提升到实际应用水平。
위료설계안전적분조밀마산법，평고산법저항차분분석화선성분석적능력지관중요。목전일개비교실제적방법취시계산분조산법활동S합적최소수목，혹자최소수목적하계。2004년Shirai등인재FSE회의상제출료일충기우한명중량침대Feistel결구적고계차분활동S합수량하계적산법。본문지출료차산법적불족，병기우일충특수적전지책략，대원산법제출료일개개진방안，장산법제승도실제응용수평。
In order to design secure block ciphers, the ability of evaluation algorithm to resist differential cryptanalysis and linear cryptanalysis is of utmost importance. Currently, a relatively practical measure is to calculate the minimum quantity of differential active S-boxes, or the lower bound of the minimum quan-tity. In 2004, Shirai et al. proposed a search algorithm to estimate the lower bound of active S-boxes quantity of Feistel based on hamming weight at FSE conference. This paper points out the flaw of this pro-posed search algorithm, and based on a special branch cutting strategy,puts forward an improved scheme is introduced to upgrade the algorithm to a practical application level.