Further study on the maximum number of bent components of vectorial functions
From MaRDI portal
Publication:2329400
Abstract: In 2018, Pott, at al. have studied in [IEEE Transactions on Information Theory. Volume: 64, Issue: 1, 2018] the maximum number of bent components of vectorial function. They have presented serval nice results and suggested several open problems in this context. This paper is in the continuation of their study in which we solve two open problems raised by Pott et al. and partially solve an open problem raised by the same authors. Firstly, we prove that for a vectorial function, the property of having the maximum number of bent components is invariant under the so-called CCZ equivalence. Secondly, we prove the non-existence of APN plateaued having the maximum number of bent components. In particular, quadratic APN functions cannot have the maximum number of bent components. Finally, we present some sufficient conditions that the vectorial function defined from to by its univariate representation: alpha x^{2^i}left(x+x^{2^k}+sumlimits_{j=1}^{
ho}gamma^{(j)}x^{2^{t_j}} +sumlimits_{j=1}^{
ho}gamma^{(j)}x^{2^{t_j+k}}
ight) has the maximum number of {components bent functions, where }. Further, we show that the differential spectrum of the function (where satisfy some conditions) is different from the binomial function presented in the article of Pott et al. Finally, we provide sufficient and necessary conditions so that the functions Tr_1^{2k}left(alpha x^{2^i}left(Tr^{2k}_{e}(x)+sumlimits_{j=1}^{
ho}gamma^{(j)}(Tr^{2k}_{e}(x))^{2^j}
ight)
ight) are bent.
Recommendations
- On constructions and properties of (n,m)-functions with maximal number of bent components
- A new method for secondary constructions of vectorial bent functions
- CCZ-equivalence of bent vectorial functions and related constructions
- On existence of vectorial bent functions from the \(\mathcal{PS}_{\mathrm{ap}}\) class
- Boolean and vectorial plateaued functions and APN functions
Cites work
- Bent functions. Fundamentals and results
- Bent vectorial functions and linear codes from o-polynomials
- Boolean and vectorial plateaued functions and APN functions
- Codes, bent functions and permutations suitable for DES-like cryptosystems
- Four decades of research on bent functions
- scientific article; zbMATH DE number 5862915 (Why is no real title available?)
- scientific article; zbMATH DE number 1088929 (Why is no real title available?)
- scientific article; zbMATH DE number 1504536 (Why is no real title available?)
- scientific article; zbMATH DE number 1394292 (Why is no real title available?)
- On ``bent functions
- On multiple output bent functions
- On the construction of bent vectorial functions
- On the Maximum Number of Bent Components of Vectorial Functions
- Perfect nonlinear S-boxes
- Vectorial Boolean functions for cryptography
- VECTORIAL BOOLEAN FUNCTIONS WITH GOOD CRYPTOGRAPHIC PROPERTIES
Cited in
(8)- On constructions and properties of (n,m)-functions with maximal number of bent components
- On the linear structures of balanced functions and quadratic APN functions
- A new method for secondary constructions of vectorial bent functions
- On the Maximum Number of Bent Components of Vectorial Functions
- Cryptographic functions with interesting properties from CCZ-equivalence
- Vectorial Boolean functions with the maximum number of bent components beyond the Nyberg's bound
- On vectorial functions with maximal number of bent components
- The combinatorial structure and value distributions of plateaued functions
This page was built for publication: Further study on the maximum number of bent components of vectorial functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329400)