scientific article; zbMATH DE number 426131
A bent function is a Boolean function \(f(x)\) from \(\mathbb{F}^ n_ 2\) to \(\mathbb{F}_ 2\) whose Fourier coefficients of \((-1)^{f(x)}\) are \(\pm 1\). The nonlinearity of a Boolean function is defined as the Hamming distance between the function and the set of all linear functions. It was proved that bent functions have the maximum nonlinearity. Bent functions exist in \(\mathbb{F}_{2^ n}\) if and only if \(n\) is even. The notion of bent permutations has been introduced in this paper. A permutation \(p(x) = (p_ 1(x), \dots, p_ n (x))\) in \(\mathbb{F}_{2^ n}\) is called bent if all components \(p_ i (x)\) \((1 \leq i \leq n)\) and all components of its inverse permutation \(p^{-1} (x) =(p^{-1}_ 1(x), \dots, p^{-1}_ n(x))\) share the same nonlinearity with bent functions in \(\mathbb{F}_{2^{n-1}}\). It is proved here that all permutations \(p(x) = \chi^{2^ i + 1}\) in \(\mathbb{F}_{2^ n}\) \((n\) is odd) are bent provided \(i\) and \(n\) are relatively prime. For the entire collection see [Zbl 0771.00039].
- Generating bent sequences
- On ``bent functions
- Improving the strict avalanche characteristics of cryptographic functions
- A note on polynomials of the form \(x^ d+a_ ex^ e+\cdots +a_ 1x+a_ 0\) over finite fields
- Bent and permutational properties of Budaghyan-Carlet hexanomials
- Homogeneous bent functions
- More permutations and involutions for constructing bent functions
- Several new classes of self-dual bent functions derived from involutions
- Further constructions of infinite families of bent functions from new permutations and their duals
- Functional circuits defining families of permutations of the space \(\mathrm{GF}(2)^n\)
- Bent polynomials over finite fields
- On the coefficients of binary bent functions
- Crooked functions
- Construction of binary bent functions by FFT-like permutation algorithms
- scientific article; zbMATH DE number 4195885 (Why is no real title available?)
- Further investigations on permutation based constructions of bent functions
- Towards the Structure of a Class of Permutation Matrices Associated with Bent Functions
- Efficient construction of permutations of high nonlinearity
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3136951)