一类分组密码的S盒重组算法  

S-boxes reorganization algorithm for a class of block ciphers

作　　者：杨宏志[1] 韩文报[1] 

机构地区：[1]信息工程大学信息工程学院,郑州450002

出　　处：《计算机应用》2009年第8期2198-2199,2203,共3页journal of Computer Applications

基　　金：国家自然科学基金重大研究计划项目(90104035);国家863计划项目(2006AA01Z425)

摘　　要：S盒是许多分组密码唯一的非线性部件,它的密码强度决定了整个密码算法的安全强度。足够大的S盒是安全的,但为了便于实现,分组密码多采用若干小S盒拼凑。针对一类分组密码算法,通过将S盒与密钥相关联,给出了S盒重组算法,丰富了S盒的应用模式,有效提高了分组密码的安全强度。S-boxes are the only nonlinear components in many block cipher algorithms, and they decide the security strength of the whole algorithm. Generally speaking, a big enough S-box is secure. However, for the convenience of implementation, several small S-boxes were combined. Concerning one class of block ciphers, an S-boxes reorganized algorithm was given, which enriched S-boxes application patterns and improved the security strength.

关 键 词：分组密码 S盒 重组 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]