No label defined (Q4367126)

The Strict Avalanche Criterion (SAC) was introduced by \textit{A. F. Webster} and \textit{S. E. Tavares} [``On the design of \(S\)-boxes'', Advances in Cryptology -- Crypto '85, Springer Lecture Notes Comput. Sci. 523-534 (1986)] in connection with a study of the decision of \(S\)-boxes in a DES-like block cipher. It can be stated as follows. Let \(\{\alpha_0, \alpha_1,\dots, \alpha_{n-1}\}\) be a basis for GF\((2^n)\), and let \(f(x)= \sum_{i=0}^{n-1} f_i(x) \alpha_i\) be a mapping from GF\((2^n)\) to itself, where each \(f_i\) is a Boolean function. The function \(f\) satisfies the SAC if for all \(i\) and \(j\), the Boolean function \(f_j(x)+ f_j(x+ \alpha_i)\) attains both binary values for \(2^{n-1}\) elements \(x\) in GF\((2^n)\). In the paper, three classes of permutations satisfying the SAC are given. One class is derived from quadratic Dickson polynomials. The second class is based on GMW functions [\textit{A. R. Scholtz} and \textit{L. R. Welch}, ``GMW sequences'', IEEE Trans. Inf. Theory 30, 548-553 (1984; Zbl 0544.65005)] with algebraic nonlinear degree 2. Using Kloosterman sums, a condition is given such that the composition of a nonsingular linear transformation and an exponential function with maximum algebraic nonlinear degree is a SAC permutation. Tables for small fields are provided.