On vectorial functions with maximal number of bent components
The authors investigate functions \(F\) on \(\mathbb{F}_{2^n}\), \(n=2m\), with the maximal possible number 2\(^n-2^m\) of bent components. In the first part, the Walsh spectrum of functions of the form \(F(x) = x^{2^e} h(\mathrm{Tr}^{2^{2m}}_{2^m}(x))\), where \(e\ge 0\) and \(h(x)\) is a permutation over \(\mathbb{F}_{2^m}\) is analysed. It is shown that for \(h\) being a monomial, the nonlinearity of \(F\) is at most \(2^{m-1} - 2^{\lfloor 3m/2\rfloor}\). \N\NIn the second part, secondary constructions are presented. In the last part it is shown that the quadratic binomial function \(F:\mathbb{F}_{2^{2m}}\rightarrow \mathbb{F}_{2^{2m}}\) given by \(F(x) = x^{2^m +1} + x^{2^i +1}\), \(0 \le i\le m-1\), has \(2^n-2^m\) bent components if and only if \(i = 0\), i.e., \(F\) is affine equivalent to \(x^{2^m +1}\). The case when \(m\) is odd was shown in [\textit{L. Zheng} et al., Des. Codes Cryptography 88, No. 10, 2171--2186 (2020; Zbl 1454.94109)].
- A new method for secondary constructions of vectorial bent functions
- A proof of the Welch and Niho conjectures on cross-correlations of binary m-sequences
- An open problem about monomial bent functions
- Analysis of (n, n)-Functions Obtained From the Maiorana-McFarland Class
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
- Bent functions from spreads
- Bent Functions With 2r Niho Exponents
- Bent functions. Fundamentals and results
- Binary m-sequences with three-valued crosscorrelation: a proof of Welch's conjecture
- Boolean functions for cryptography and coding theory
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Constructing vectorial bent functions via second-order derivatives
- Cyclic codes with few weights and Niho exponents
- Cyclotomy of Weil sums of binomials
- Explicit evaluations of some Weil sums
- Four decades of research on bent functions
- Further study on the maximum number of bent components of vectorial functions
- Generic Construction of Bent Functions and Bent Idempotents With Any Possible Algebraic Degrees
- Generic Constructions of (Boolean and Vectorial) Bent Functions and Their Consequences
- scientific article; zbMATH DE number 1394295 (Why is no real title available?)
- Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)
- Monomial bent functions
- New bent functions from permutations and linear translators
- On ``bent functions
- On a Class of Functions With the Maximal Number of Bent Components
- On constructions and properties of (n,m)-functions with maximal number of bent components
- On Quadratic Bent Functions in Polynomial Forms
- On the Maximum Number of Bent Components of Vectorial Functions
- One-to-one highly nonlinear power functions on \(\mathrm{GF}(2^n)\)
- Perfect nonlinear S-boxes
- Several New Classes of Bent Functions From Dillon Exponents
- Several new infinite families of bent functions via second order derivatives
- Some results about the cross-correlation function between two maximal linear sequences
- Vectorial bent functions and linear codes from quadratic forms
- Vectorial Boolean functions with the maximum number of bent components beyond the Nyberg's bound
This page was built for publication: On vectorial functions with maximal number of bent components
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6956593)
