分组密码算法两种S盒设计的可证安全性注记  

A Note to Provable Security About Two Kind of S-boxes in Block Cipher

作　　者：罗岚 魏正耀[1] 秦志光[1] 石竑松[1] 唐寅 

机构地区：[1]电子科技大学计算机科学与工程学院,四川成都610054 [2]北京市984信箱108号,北京100091

出　　处：《信息安全与通信保密》2007年第3期40-42,共3页Information Security and Communications Privacy

基　　金：国家自然科学基金(60573129)资助

摘　　要：对分组密码算法进行可证明安全性的工作存在一些争论。我们针对分组密码算法S盒设计的可证明安全性进行研究并提出:可证明安全性是设计者对算法应该采取的说明与论证过程;对分析者而言,只有当算法被破译之后才能否定安全性的证明。而在遵循S盒设计规则的同时,从多项式代数表出次数、相对于完全随机的优势度、线性偏差概率、非线性偏差概率等方面加以描述是必要的过程。Some problems exist in provable security of block cipher algorithm and the provable security of block cipher cannot be described exactly. This article is about the provable security of s-box. Taking a proper approach for the provable security of block cipher is a necessary job for the designer. We consider that provable security cannot be negated until the algorithm has been decrypted. The provable security of s-box for block cipher should include polynomial of its aigebraic degree, the advantage for relative randomness, linear probability and noniinear probability.

关 键 词：分组密码算法 S盘设计 可证明安全性 

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