GF(2^(2m))上一个具有轻量硬件实现和已知最优密码学性质的完全置换（英文）  

A Complete Permutation Over GF(2^(2m)) With Easy Hardware Implementation and the Best Known Cryptography Properties

作　　者：唐再良[1] 王明生[2] 

机构地区：[1]绵阳师范学院信息安全研究所,绵阳四川621006 [2]中国科学院信息工程研究所信息安全国家重点实验室,北京100093

出　　处：《数学进展》2017年第1期55-62,共8页Advances in Mathematics（China）

基　　金：Supported in part by 973 Project(No.2013CB834203);NSFC(No.61379142)

摘　　要：完全置换是在密码算法的设计中广泛适用的特殊置换.在密码应用中,常常要求置换具有低的差分均匀度和高的非线性度,以抵抗差分和线性攻击.在轻量密码算法的应用中,一个置换应当具有低的硬件实现代价.本文在偶数域GF(2^(2m))(m为奇数)上给出了一个差分均匀度为4,具有最高非线性度且具有轻量实现代价的完全置换.该置换从域的一个2次子域GF(2~m)的一个置换函数构造而来,这意味该置换具有低的硬件实现代价.Complete permutations are special permutations which are widely used in the design of cryptography algorithms. In application of cryptography, it often requires that permu- tations possess low differential uniformity and high nonlinearity to resist differential attack and linear attack. For applications in lightweight cryptography algorithms, a permutation should be convenient for hardware implementation. In the present paper, a differentially 4-uniform permutation with the best known nonlinearity over GF（2 2m） with odd rn is presented. It is con- structed from a function over GF（2m）, which means that it has a low hardware implementation cost.

关 键 词：密码S-盒子 差分均匀度 非线性度 轻量密码学 

分 类 号：O157.4[理学—数学]