Permutation polynomials over finite fields are fundamental objects as they are used in
various theoretical and practical applications in cryptography, coding theory, combinatorial …

An involution is a permutation whose compositional inverse is itself. Differentially 4-uniform
involutions with high algebraic degree and high nonlinearity are important for the design of …

We define the pAPN-spectrum (which is a measure of how close a function is to being APN)
of an (n, n)-function F and investigate how its size changes when two of the outputs of a …

In this paper, we determine the differential spectra of two known classes of involutions with
low differential uniformity over finite fields with even characteristic completely. The key point …

Substitution boxes are used in many iterate block ciphers for the confusion part of round
functions. In this paper, we present some constructions of differentially 6-uniform …

Abstract Let f (x)= xq-3 2 be a power mapping over F q, where q is an odd prime power. The
differential uniformity of f was determined by Helleseth and Sandberg in 1997. In this paper …

The differential-linear connectivity table (DLCT) of a vectorial Boolean function was recently
introduced by Bar-On et al. at EUROCRYPT'19. In this paper we construct a new class of …

Permutations with low differential uniformity, high algebraic degree, and high nonlinearity
over F 2 2 k can be used as the substitution boxes for many block ciphers. In this paper …

We introduce a search algorithm to find permutation S-boxes with low differential uniformity,
high nonlinearity and high algebraic degree, which play important roles in block ciphers …

密码函数包含布尔函数与向量函数(S-盒) 两大类, 是构成序列密码, 分组密码和Hash
函数这三类密码算法的重要组件, 其密码学性质的好坏直接关系到密码算法的安全性 …