| 分组密码S盒的代数方程 |
| |
| 引用本文： | 李伟博,解永宏,胡磊.分组密码S盒的代数方程[J].中国科学院研究生院学报,2008,25(4):524-529. |
| |
| 作者姓名： | 李伟博 解永宏 胡磊 |
| |
| 作者单位： | 中国科学院研究生院信息安全国家重点实验室,北京,100049 |
| |
| 基金项目： | 国家自然科学基金
,
国家高技术研究发展计划(863计划) |
| |
| 摘 要： | 研究了几种著名的分组密码体制的Ｓ盒所满足的代数方程的个数，如DES、AES、MARS、SERPENT等，分别计算出这几种分组密码的Ｓ盒从低次到高次的代数方程的个数，并把 计算结果和理论极小值进行了比较．此外，还针对一类对密码分析具有特别意义的不完全代数方程研究了Ｓ盒所满足的这类不完全代数方程的个数，通过这类方程的个数，可以看到它们的Ｓ盒与随机Ｓ盒的差别．
|
| 关 键 词： | 分组密码 S盒 代数方程 |
Algebraic equations of S-box block cipher |
| |
| LI Wei-Bo,XIE Yong-Hong,HU Lei.Algebraic equations of S-box block cipher[J].Journal of the Graduate School of the Chinese Academy of Sciences,2008,25(4):524-529. |
| |
| Authors: | LI Wei-Bo XIE Yong-Hong HU Lei |
| |
| Abstract: | This paper focuses on the number of algebraic equations, which describe the S-boxes of several famous block ciphers such of DES, AES, MARS and SERPENT. We compute the number of these algebraic equations from low degree to high degree. A comparison between the number of these equations and the theoretical minimum value is presented. Moreover, this paper introduces a kind of incomplete algebraic equations which are especially important to cryptanalysis. By comparing the number of these incomplete equations with that of a random S-box, a difference is shown between the S-boxes of these block ciphers and a random S-box. |
| |
| Keywords: | block cipher S-box algebraic equations |
| 本文献已被 万方数据 等数据库收录！ |
| 点击此处可从《中国科学院研究生院学报》浏览原始摘要信息 |
| 点击此处可从《中国科学院研究生院学报》下载免费的PDF全文 |
