On vectorial functions with maximal number of bent components
Preprint
Abstract
We study vectorial functions with maximal number of bent components in this paper. We first give a construction of such functions from known ones, thus obtain two new classes from the Niho class and the Maiorana-McFarland class. Our construction gives a partial answer to an open problem proposed by Pott et al., and also solves an open problem proposed by Mesnager. We then show that the vectorial function $F: \F_{2^{2m}}\rightarrow \F_{2^{2m}}$, $x\mapsto x^{2^m+1}+x^{2^i+1}$ has maximal number of bent components if and only if $i=0$.
Keywords
All Related Versions
This publication has 20 references indexed in Scilit:
- Boolean Functions for Cryptography and Coding Theory2020
- On constructions and properties of (n, m)-functions with maximal number of bent componentsDesigns, Codes and Cryptography, 2020
- Several new infinite families of bent functions via second order derivativesCryptography and Communications, 2020
- Further study on the maximum number of bent components of vectorial functionsDesigns, Codes and Cryptography, 2019
- Vectorial bent functions and their dualsLinear Algebra and its Applications, 2018
- Four decades of research on bent functionsDesigns, Codes and Cryptography, 2015
- Bent functions from spreads2015
- Bent vectorial functions and linear codes from o-polynomialsDesigns, Codes and Cryptography, 2014
- On multiple output bent functionsInformation Processing Letters, 2012
- Monomial bent functions and Stickelberger's theoremFinite Fields and Their Applications, 2008