论文部分内容阅读
完全置换是在密码算法的设计中广泛适用的特殊置换.在密码应用中,常常要求置换具有低的差分均匀度和高的非线性度,以抵抗差分和线性攻击.在轻量密码算法的应用中,一个置换应当具有低的硬件实现代价.本文在偶数域GF(2~(2m))(m为奇数)上给出了一个差分均匀度为4,具有最高非线性度且具有轻量实现代价的完全置换.该置换从域的一个2次子域GF(2~m)的一个置换函数构造而来,这意味该置换具有低的硬件实现代价.
Complete permutation is a special permutation that is widely used in the design of cryptographic algorithms. In cryptographic applications, permutations are often required to have low differential uniformity and high non-linearity to resist differential and linear attacks.In the application of lightweight cryptographic algorithms , A permutation should have a low cost of hardware implementation.In this paper, we give a differential uniformity of 4 in the even field GF (2 ~ (2m)) (m is odd), with the highest nonlinearity and light weight Complete replacement of the cost The replacement is constructed from a permutation function of a second-order subfield GF (2 ~ m) of the domain, which means that the permutation has a low hardware implementation cost.