Research on the Linear Redundancy in the AES S Box

JIN Chen-hui; SUN Ying

您当前的位置：

首页 >

文章列表页 >

Research on the Linear Redundancy in the AES S Box

更新时间：2025-07-16

- Research on the Linear Redundancy in the AES S Box
- Acta Electronica Sinica Vol. 32, Issue 4, Pages: 639-641(2004)
- 作者机构：
  
  解放军信息工程大学电子技术学院,河南,郑州,450004
- 作者简介：
- 基金信息：
- DOI：
  CLC： TN918.1
- Published：2004
- 稿件说明：
移动端阅览
JIN Chen-hui, SUN Ying. Research on the Linear Redundancy in the AES S Box[J]. Acta Electronica Sinica, 2004, 32(4): 639-641.
DOI：

JIN Chen-hui, SUN Ying. Research on the Linear Redundancy in the AES S Box[J]. Acta Electronica Sinica, 2004, 32(4): 639-641. DOI：

摘要

本文借助有限域上的迹变换

证明了有限域

GF(2

)上的幂双射x

的坐标函数的非零线性组合都线性等价

且等价变换共有2

-1

个;证明了AES算法的S盒的坐标函数的非零线性组合都线性等价

且在添加0元后

本文构造的坐标函数的给定线性组合到其它线性组合的等价变换全体构成{0

emn同构的群.本文还给出了AES算法的S盒的最低坐标函数到其它坐标函数的等价变换

它们构成了等价变换群的一组基.本文还证明了Fuller J和Millan W构造的等价变换之和都不再是坐标函数的线性组合之间的等价变换.

Abstract

It's proved that the nonzero linear combinations of the coordinates (NLCC for short) of a bijective monomial in a finite field of characteristic two are linearly equivalent

and the number of equivalent transformations is equal to the number of nonzero elements in the finite field.It's prove that the NLCCs of S-boxes of AES are linear equivalent

and the group formed by the zero transformation and all transformations constructed in this paper for equivalence of a given NLCC to NLCCs under the pointwise addition of transformations is isomorphic to additive group of the finite field.The equivalent transformations of the least significant coordinate to 8 coordinates are given

which is a base of this group.It's proved also that the sum of equivalent transformations of coordinates constructed by Fuller J and Millan W is not an equivalent transformation of two NLCCs of S-boxes of AES.

关键词

Keywords

references

Views

1103

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

ST-OOC Designing for OCDMA System Based on Steiner System

The Characteristic of Quadratic Bent Functions and Its Applications

An Optimal Normal Basis Type Ⅱ Multiplier over GF(2ⁿ) for FPGAs

The Linear Complexity of a New Class of Generalized Cyclotomic Binary Sequences of Length p^m+1qⁿ⁺¹

Blind Parameter Identification of RS Code Based on Binary Field Equivalence

Related Author

Zhao De-lin

Guo Sheng-li

ZHANG Ming-de

SUN Xiao-han

LI Chuan-qi

LI Shi-qu

ZHANG Wen-ying

DAI Yi-qi

Related Institution

Nanjing University of Information Science and Technology

Department of Electronics Engineering,Southeast University

Nanjing University of Information Science and TechnologyNanjing 210044China

Department of Electronics EngineeringSoutheast UniversityNanjing 210096China

Dept.of Information Research,Institute of Information Engineering

⁰