利用遗传算法构造S-盒  

Construct S-box by Genetic Algorithm

作　　者：吴礼银[1] 胡汉平[1] 

机构地区：[1]华中科技大学图像识别与人工智能研究所,武汉430074

出　　处：《计算机与数字工程》2005年第2期36-39,共4页Computer & Digital Engineering

摘　　要：S(substitution) -盒是许多分组密码算法中的唯一非线性映射 ,它的密码强度决定了整个密码算法的安全强度。目前多采用m -序列、幂函数等方法来构造S -盒 ,但对于构造性能优良的 8× 8S -盒上述方法并不十分有效。本文采用遗传算法构造S -盒 ,引入约束条件减小了S -盒的搜索空间 ,提高了搜索S -盒的效率。实验结果表明 ,该方法可以快速搜索到大量能够较强地抵抗差分密码分析和线性密码分析的SS-box is the only nonlinear component in many algorithms for encryption,intension of which decides the security strength on the whole algorithm.At present many methods are adopted to construct S-box,such as m-sequence,exponential function,and so on.But they are not effective to construct 8×8 S-box of good qualities.In this paper, Genetic Algorithm is used to search 8×8 S-boxes,constraints are used to reduce the search space,and the efficiency of searching S-boxes is improved obviously.Results of the experiment show that the Genetic Algorithm can find a great deal of S-boxes quickly, which can resist differential analysis and linear analysis efficiently.

关 键 词：分组密码 S-盒 遗传算法 密码分析 

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