| AES类S盒与Camellia类S盒的代数复杂度分析 |
| |
| 引用本文： | 郭艳珍,韩文报,何开成,张猛.AES类S盒与Camellia类S盒的代数复杂度分析[J].信息安全与通信保密,2009(6):69-71. |
| |
| 作者姓名： | 郭艳珍 韩文报 何开成 张猛 |
| |
| 作者单位： | 解放军信息工程大学信息研究系,河南,郑州,450002 |
| |
| 基金项目： | 国家高技术研究发展计划(863计划)，国家自然科学基金 |
| |
| 摘 要： | S盒是很多分组密码算法唯一的非线性部件，它的密码学性质对分组密码的安全性至关重要。该文主要研究与有限域上逆变换仿射等价S盒的代数复杂度问题，利用有限域上的线性化多项式给出了两类S盒的最大代数复杂度，并得到了Camellia类S盒退化为AES类S盒的一个充分必要条件。
|
| 关 键 词： | AES Camellia S盒 代数复杂度 |
Algebra Complexity Analysis of AES-Class S box and Camellia-Class S Box |
| |
| GUO Yan-zhen,HAN Wen-bao,HE Kai-cheng,ZHANG Meng.Algebra Complexity Analysis of AES-Class S box and Camellia-Class S Box[J].China Information Security,2009(6):69-71. |
| |
| Authors: | GUO Yan-zhen HAN Wen-bao HE Kai-cheng ZHANG Meng |
| |
| Affiliation: | (Department of Information research, PLA Information Engineering University, Zhengzhou Henan 450002, China) |
| |
| Abstract: | S-Box is the unique component in many block ciphers, and its cryptological property is crucial to the security of the cipher. The paper principally describes researches on the algebraic complexity of the S-Box, which is based on the affine equivalence of the inversion of the element in finite field. And the AES S-Box class and Camellia S-Box class are defined. Then we use the linearized polynomial in the finite field isused to get the maximal algebraic complexity of AES S-Box class and Camellia S-Box class. Finally, a sufficient and necessary condition of Camellia S-Box degenerated to AES S-Box is obtained. |
| |
| Keywords: | AES Camellia |
| 本文献已被 维普 万方数据 等数据库收录！ |
