{ "id": "2010.03801", "version": "v1", "published": "2020-10-08T07:06:08.000Z", "updated": "2020-10-08T07:06:08.000Z", "title": "On functions with the maximal number of bent components", "authors": [ "Nurdagül Anbar", "Tekgül Kalaycı", "Wilfried Meidl", "László Mérai" ], "categories": [ "math.NT", "cs.IT", "math.IT" ], "abstract": "A function $F:\\mathbb{F}_2^n\\rightarrow \\mathbb{F}_2^n$, $n=2m$, can have at most $2^n-2^m$ bent component functions. Trivial examples are obtained as $F(x) = (f_1(x),\\ldots,f_m(x),a_1(x),\\ldots, a_m(x))$, where $\\tilde{F}(x)=(f_1(x),\\ldots,f_m(x))$ is a vectorial bent function from $\\mathbb{F}_2^n$ to $\\mathbb{F}_2^m$, and $a_i$, $1\\le i\\le m$, are affine Boolean functions. A class of nontrivial examples is given in univariate form with the functions $F(x) = x^{2^r}{\\rm Tr^n_m}(\\Lambda(x))$, where $\\Lambda$ is a linearized permutation of $\\mathbb{F}_{2^m}$. In the first part of this article it is shown that plateaued functions with $2^n-2^m$ bent components can have nonlinearity at most $2^{n-1}-2^{\\lfloor\\frac{n+m}{2}\\rfloor}$, a bound which is attained by the example $x^{2^r}{\\rm Tr^n_m}(x)$, $1\\le r