Feistel结构差分活动S盒的搜索算法  

Search Algorithm for Differential Active S-boxes of Feistel Structure

作　　者：明亚运 祝世雄[1] 曹云飞[1] 

机构地区：[1]保密通信重点实验室,四川成都610041

出　　处：《通信技术》2014年第10期1207-1210,共4页Communications Technology

基　　金：国家自然科学基金(No.61309034);四川青年基金资助项目(No.2014JQ0055)~~

摘　　要：为了设计安全的分组密码算法,评估算法抵抗差分分析和线性分析的能力至关重要。目前一个比较实际的方法就是计算分组算法活动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 quantity. 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 proposed 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.

关 键 词：FEISTEL结构 差分分析 活动 S盒 

分 类 号：TN918[电子电信—通信与信息系统]