---
abstract: 'For any positive integers $n=2k$ and $m$ such that $m\geq k$, in this paper we show the maximal number of bent components of any $(n,m)$-functions is equal to $2^{m}-2^{m-k}$, and for those attaining the equality, their algebraic degree is at most $k$. It is easily seen that all $(n,m)$-functions of the form $G(x)=(F(x),0)$ with $F(x)$ being any vectorial bent $(n,k)$-function, have the maximum number of bent components. Those simple functions $G$ are called trivial in this paper. We show that for a power $(n,n)$-function, it has such large number of bent components if and only if it is trivial under a mild condition. We also consider the $(n,n)$-function of the form $F^{i}(x)=x^{2^{i}}h({\rm Tr}^{n}_{e}(x))$, where $h: \mathbb{F}_{2^{e}} \rightarrow \mathbb{F}_{2^{e}}$, and show that $F^{i}$ has such large number if and only if $e=k$, and $h$ is a permutation over $\mathbb{F}_{2^{k}}$. It proves that all the previously known nontrivial such functions are subclasses of the functions $F^{i}$. Based on the Maiorana-McFarland class, we present constructions of large numbers of $(n,m)$-functions with maximal number of bent components for any integer $m$ in bivariate representation. We also determine the differential spectrum and Walsh spectrum of the constructed functions. It is found that our constructions can also provide new plateaued vectorial functions.'
author:
- 'Lijing Zheng $^{\diamond}$, Jie Peng $^{*}$, Haibin Kan $^{\diamond }$, Yanjun Li$~^{*}$, and Juan Luo [^1]'
title: 'On constructions and properties of $(n,m)$-functions with maximal number of bent components'
---

[**Index Terms:**]{} Bent functions, vectorial bent, algebraic degree, differential uniformity, Walsh spectrum.

[**MSC:**]{} 94A60, 11T71, 14G50.

Introduction
============

Throughout this paper, we often identify the finite field $\mathbb{F}_{2^{n}}$ with $\mathbb{F}^{n}_{2}$, the $n$-dimensional vector space over $\mathbb{F}_{2}$. Any function $F: \mathbb{F}_{2^{n}}\rightarrow\mathbb{F}_{2^{m}}$ is called an [*$(n,m)$-function*]{}. When $m=1$ it is usually called a [*Boolean function*]{}. [*Bent functions*]{}, as a special class of Boolean functions, were introduced by Rothaus [@Rothaus] in 1976. A bent function is a Boolean function in even number of variables which is maximally nonlinear in the sense that its Hamming distance to all affine functions is optimal. It corresponds to the fact that the [*Walsh transform*]{} of a bent function in $n$ variables takes precisely the values $\pm 2^{\frac{n}{2}}$. Over the last four decades, bent functions have attracted a lot of research interest because of their relations to coding theory and applications in cryptography. A survey on bent functions can be found in [@Car-Mes16] as well as the book [@Mes16].

The bent property of Boolean functions has been extended to general $(n,m)$-functions by requesting that all the nonzero linear combinations of the [*coordinate functions*]{} of $F$ are bent functions. Such functions are called [*vectorial bent*]{}. The construction of vectorial bent functions has been initially considered by Nyberg [@Nyb]. It was shown in [@Nyb] that vectorial bent $(n,m)$-functions exist if and only if $n$ is even and $m\leq n/2$. Such functions can be constructed by using some known classes of bent functions, such as the [*Maiorana-McFarland class*]{} (denoted by $\mathcal{M}$) and the Dillon’s [*partial spread class*]{} (denoted by $\mathcal{PS}$). In the finite field version, the bent property of $(n,m)$-functions $F: \mathbb{F}_{2^{n}} \rightarrow \mathbb{F}_{2^{m}}$ with $\mathbb{F}_{2^{m}}\subseteq \mathbb{F}_{2^{n}}$ can be established directly as it was done in [@MPS] for the trace functions ${\rm Tr}^{n}_{k}(\sum\limits^{2^{k}}_{i=0}\alpha_{i}x^{i(2^{k}-1)})$, where $n=2k$ and $\alpha_{i}\in \mathbb{F}_{2^{n}}$, see [@Mes16] for more constructions of vectorial bent functions.

An interesting and important problem concerning bent functions and vectorial bent functions is that, how large could the number of [*bent components*]{} of an $(n,m)$-function be ($n$ being even)? Thanks to Nyberg’s result, the largest value of this number is $2^m-1$ when $m\leq n/2$. While for $m>n/2$, the answer is unknown before. Very recently, Pott et al. studied this number for the case $m=n$. In [@Pott] they showed that this number is upper bounded by $2^{n}-2^{n/2}$, which is attained by the functions of the form $F(x)=x^{2^{i}}(x+x^{2^{k}})$, where $n=2k, 0 \leq i\leq n-1$. They also pointed out that vectorial functions with maximal number of bent components can produce new vectorial bent functions. More precisely, for any $(n,n)$-function $G$, if ${\rm Tr}^{n}_{1}(\alpha G(x))$ is bent for any $\alpha\in\mathbb{F}_{2^{n}}\setminus\mathbb{F}_{2^{k}}$, then ${\rm Tr}^{n}_{k}(\alpha G(x))$ is a vectorial bent function for any $\alpha \in \mathbb{F}_{2^{n}}\setminus\mathbb{F}_{2^{k}}$. Therefore, ${\rm Tr}^{n}_{k}(\gamma F(x))$ is vectorial bent for any primitive element $\gamma$ in $\mathbb{F}^{\ast}_{2^{n}}$ and the functions $F$ listed above. Later, Mesnager et al. presented a class of $(n,n)$-functions with maximal number of bent components of the form $H(x)=x^{2^{i}}(x+x^{2^{k}}+\sum\limits^{\rho}_{j=1}\gamma^{(j)}(x^{2^{t_{j}}}+x^{2^{t_{j}+k}}))$ under some additional conditions, where $\gamma^{(j)}\in \mathbb{F}_{2^{k}}$ [@MZTZ]. In the same paper, the authors also proved that APN plateaued functions cannot have the maximum number of bent components. In some earlier works, the number of bent components of APN functions and differentially 4-uniform functions were discussed and some lower bounds were obtained (see [@Bcc; @Cp]).

Let $n=2k$, and $m\geq k$. In this paper, at first we show that the maximal number of bent components of any $(n,m)$-function is equal to $2^{m}-2^{m-k}$, and when the equality holds, the *algebraic degree* of such functions is at most $k$. For any vectorial bent $(n,k)$-function $F(x)$, with the inclusion map $i: \mathbb{F}^{k}_{2}\rightarrow \mathbb{F}^{m}_{2}$, $a\mapsto (a,0)$, it can also be regarded as an $(n,m)$-function which has the maximal number $2^{m}-2^{m-k}$ of bent components. For this reason, we call the $(n,m)$-function $G(x)=(F(x),0)$ *trivial*. Our main contributions to the constructions and characterizations of such functions are summarized as follows:

$\bullet$ The case of $(n,m)$-functions.

Based on the Maiorana-McFarland class, we present a nontrivial construction of such functions in [*bivariate representation*]{} $G(x,y)=(x^{2^{i}}\pi(y)+g(y),h(y))$, where $(x,y)\in \mathbb{F}_{2^{k}}\times \mathbb{F}_{2^{k}}$, $\pi: \mathbb{F}_{2^{k}}\rightarrow \mathbb{F}_{2^{k}}$ is a permutation, $g(y):\mathbb{F}_{2^{k}}\rightarrow \mathbb{F}_{2^{k}}$ and $h(y):\mathbb{F}_{2^{k}}\rightarrow \mathbb{F}_{2^{m-k}}$ are arbitrary functions.

$\bullet$ The case of $(n,n)$-functions.

1\) Let $F(x)=x^d$. We show that $F(x)$ has the maximal number of bent components if and only if $F(x)$ is a vectorial bent $(n,k)$-function. Say $F$ is trivial.

2\) For any positive integer $e$ dividing $k$, we consider the $(n,n)$-functions in [*univariate representation*]{} of the form $$F^{i}(x)=x^{2^{i}}h({\rm Tr}^{n}_{e}(x)),$$ where $0\leq i\leq n-1$, $h: \mathbb{F}_{2^{e}}\rightarrow \mathbb{F}_{2^{e}}$ is an arbitrary function. We show that the functions ${\rm Tr}^{n}_{1}(\alpha F^{i}(x))$ is bent for any $\alpha \in \mathbb{F}_{2^{n}}\setminus\mathbb{F}_{2^{k}}$ if and only if $e=k$, and $h$ is a permutation over $\mathbb{F}_{2^{e}}$. Hence the functions $F^{i}(x)=x^{2^{i}}h({\rm Tr}^{n}_{k}(x))$ yield new vectorial bent functions ${\rm Tr}^{n}_{k}(\alpha F^{i}(x))$, where $h$ is a permutation over $\mathbb{F}_{2^{k}}$.

One will see the functions $F(x)=x^{2^{i}}(x+x^{2^{k}})$ given by [@Pott] and $H(x)=x^{2^{i}}(x+x^{2^{k}}+\sum\limits^{\rho}_{j=1}\gamma^{(j)}(x^{2^{t_{j}}}+x^{2^{t_{j}+k}}))$ given by [@MZTZ] are subclasses of our functions $F^{i}(x)$, which means that all the known nontrivial $(n, n)$-functions with maximum number of bent components are covered by our results, to the best of our knowledge.

The rest of the paper is organized as follows. Some basic definitions are given in Section 2. In Section 3, we prove that the maximum number of bent components of $(n=2k,m)$-functions is equal to $2^m-2^{m-k}$, and when the equality holds, the algebraic degree of such functions is at most $k$. We give a characterization of the power $(n,n)$-functions admitting such large number of bent components. In Section 4, we put forward a construction of $(n,m)$-functions in bivariate representation with maximum number of bent components, and determine the [*differential spectrum*]{} and [*Walsh spectrum*]{}. We also show that the $(n,n)$-functions $F^{i}(x)=x^{2^{i}}h({\rm Tr}^{n}_{e}(x))$ has the maximal number of bent components if and only if $e=k$, and $h$ is a permutation over $\mathbb{F}_{2^{e}}$, where $n=2k$, and $e$ is a positive integer dividing $k$, $h$ is an arbitrary map from $\mathbb{F}_{2^{e}}$ to $\mathbb{F}_{2^{e}}$. This yields new vectorial bent function ${\rm Tr}^{n}_{k}(\alpha x^{2^{i}}h({\rm Tr}^{n}_{k}(x)))$, where $h$ is a permutation over $\mathbb{F}_{2^{k}}$, $\alpha$ is a primitive element in $\mathbb{F}_{2^{n}}$. Moreover, we compare our new construction with previous ones, and prove that all the known nontrivial results are covered by ours. A few concluding remarks are given in Section 5.

Preliminaries
=============

Let $\mathbb{F}_{2^{n}}$ be the finite field consisting of $2^{n}$ elements, then the group of units of $\mathbb{F}_{2^{n}}$, denoted by $\mathbb{F}^{\ast}_{2^{n}}$, is a cyclic group of order $2^{n}-1$. Throughout this paper we always identify $\mathbb{F}_{2^{n}}$ with the vector space $\mathbb{F}^{n}_{2}$ over $\mathbb{F}_{2}$. Any function $F: \mathbb{F}_{2^{n}}\rightarrow\mathbb{F}_{2^{m}}$ is called an $(n,m)$-function ([*cryptographic function*]{}, [*vectorial Boolean function*]{} or [*substitution box*]{}). Usually $(n,1)$-functions are called Boolean functions in $n$ variables, the set of which is denoted by $\mathcal{B}_{n}$. As cryptographic functions, the main cryptographic criteria for Boolean functions are algebraic degree, [*nonlinearity*]{} and [*algebraic immunity*]{}, etc. (see [@Carletb1]), and the main cryptographic criteria for vectorial Boolean functions are algebraic degree, nonlinearity and [*differential uniformity*]{}, etc. (see [@Carletb2]).

The trace function ${\rm Tr}^{n}_{m}: \mathbb{F}_{2^{n}}\rightarrow \mathbb{F}_{2^{m}}$, where $m|n$, is defined as $${\rm Tr}^{n}_{m}(x)\!=\!x\!+\!x^{2^{m}}\!+\!x^{2^{2m}}\!+\!\cdots\!+\!x^{2^{(n/m\!-\!1)m}}, ~\forall ~x\in \mathbb{F}_{2^{n}}.$$ When $m=1$, it is also called the absolute trace. In this paper, $\langle,\rangle$ denotes the usual [*inner product*]{} in a vector space over $\mathbb{F}_{2}$. For any $\alpha=(\alpha_1,\ldots,\alpha_n), \beta=(\beta_1,\ldots,\beta_n)\in\mathbb{F}_2^{n}$, one has $\langle\alpha,\beta\rangle=\sum_{i=1}^n\alpha_i\beta_i$. While in the finite field $\mathbb{F}_{2^{n}}$, we take $\langle\alpha,\beta\rangle={\rm Tr}^{n}_{1}(\alpha\beta)$ for any $\alpha,\beta\in\mathbb{F}_{2^{n}}$.

For any $(n,m)$-function $F=(f_1,\ldots,f_m)$, where $f_1,\ldots,f_m\in\mathcal{B}_{n}$, all the nonzero linear combinations of $f_i, 1\leq i\leq m$ are called the components of $F$. When $F$ is viewed as a mapping from the finite field $\mathbb{F}_{2^{n}}$ to $\mathbb{F}_{2^{m}}$, the components of $F$ can be represented as ${\rm Tr}_1^m(\lambda F(x)), ~\lambda\in\mathbb{F}_{2^{m}}^*.$

A Boolean function $f\in\mathcal{B}_{n}$ can be uniquely represented by a multivariate polynomial as $$\begin{aligned}
f(x_1,\ldots,x_n)\!=\!\sum_{I\subseteq
\{1,2,\ldots,n\}}a_I\prod_{i\in I}x_i,\end{aligned}$$ where the number of variables in the highest order term with nonzero coefficient is called the algebraic degree of $f$. While for a general $(n,m)$-function $F$, the highest algebraic degree of its coordinate functions is called the algebraic degree of $F$. The function $F$ is called [*quadratic*]{} if its algebraic degree is no more than 2.

The [*Walsh transform*]{} of a Boolean function $f\in \mathcal{B}_{n}$ at a point $\lambda \in \mathbb{F}_{2^{n}}$ is defined by $$W_{f}(\lambda)\!=\!\sum\limits_{x\in \mathbb{F}_{2^{n}}}(\!-\!1)^{f(x)\!+\!{\rm Tr}^{n}_{1}(\lambda x)}.$$ A function $f\in \mathcal{B}_{n}$ is called bent if $|W_{f}(\lambda)|=2^{\frac{n}{2}}$ for all $\lambda \in \mathbb{F}_{2^{n}}$. It is well known that bent functions exist if and only if $n$ is even. To find bent functions is a hard task. So far the known largest class of bent functions is the so called Maiorana-McFarland class of bent functions (denoted by $\mathcal{M}$) [@McF], which are of the form $f(x,y)={\rm Tr}^{k}_{1}(\pi(y)x)+g(y)$, $(x,y)\in \mathbb{F}_{2^{k}}\times  \mathbb{F}_{2^{k}}$, where $k$ is some positive integer, $\pi$ is a permutation over $\mathbb{F}_{2^{k}}$ and $g$ is an arbitrary Boolean function in $k$ variables. The function $f$ is called [*plateaued*]{} when either it is bent or $W_f$ takes three values $\{0,\pm 2^{s}\}$ for some integer $n/2< s\leq n$.

The nonlinearity of an $(n,m)$-function $F$ and hereby its resistance to [*linear cryptanalysis*]{} [@Matsui] is measured through the [*extended Walsh spectrum*]{} $$\{\ast~ |W_{F}(\sigma,\gamma)|:\gamma \in \mathbb{F}^{m}_{2}\backslash\{0\},\sigma \in \mathbb{F}^{n}_{2} ~\ast\},$$ where $$W_{F}(\sigma,\gamma)\!=\!\sum\limits_{x\in  \mathbb{F}^{n}_{2}}(\!-\!1)^{\langle \sigma,x\rangle\! +\!\langle \gamma,F(x)\rangle }.$$ The function $F$ is said to be a [*vectorial bent function*]{} of dimension $m$ if all the components of $F$ are bent. In other words, $F$ is vectorial bent if and only if $|W_{F}(\sigma,\gamma)|=2^{n/2}$, for any $\gamma \in \mathbb{F}^{m}_{2}\backslash\{0\}$ and for any $\sigma\in\mathbb{F}^{n}_{2}$. $F$ is said to be a [*plateaued vectorial function*]{} if all the components are plateaued Boolean functions.

For an $(n,m)$-function $F$, denote by $\delta_{F}(a,b)$ the number of solutions $x\in\mathbb{F}^{n}_{2}$ such that $F(x+a)+F(x)=b$, for any $a\in\mathbb{F}^{n}_{2}$ and $b\in\mathbb{F}^{m}_{2}$. The multiset $$\{\ast ~\delta_{F}(a,b):a\in \mathbb{F}^{n}_{2}\backslash \{0\}, b\in\mathbb{F}^{m}_{2}~ \ast \},$$ is called the [*differential spectrum*]{} of $F$, and $F$ is said to be differentially $\delta$-uniform, where $\delta=\max_{a\in \mathbb{F}^{n}_{2}\backslash \{0\}, b\in\mathbb{F}^{m}_{2}}\delta_{F}(a,b)$. In particular, $F$ is called [*almost perfect nonlinear*]{} (${\rm APN}$ for short) if $\delta=2$. For cryptographic applications, it is usually required that the differential uniformity of $F$ should be as low as possible (see for instance [@Pt] and the references therein).

Two $(n,m)$-functions $F$ and $G$ are called [*extended affine equivalent*]{} (EA-equivalent) if there exist some affine permutation $L_1$ over $\mathbb{F}_{2^n}$ and some affine permutation $L_2$ over $\mathbb{F}_{2^m}$, and some affine function $A$ such that $F=L_2\circ G\circ L_1+A$. They are called [*Carlet-Charpin-Zinoviev equivalent*]{} (CCZ-equivalent) if there exists some affine automorphism $L=(L_1, L_2)$ of $\mathbb{F}_{2^n}\times \mathbb{F}_{2^m}$, where $L_1: \mathbb{F}_{2^n}\times \mathbb{F}_{2^m}\rightarrow \mathbb{F}_{2^n}$ and $L_2: \mathbb{F}_{2^n}\times \mathbb{F}_{2^m}\rightarrow \mathbb{F}_{2^m}$ are affine functions, such that $y=G(x)$ if and only if $L_2(x, y)=F\circ L_1(x, y)$. It is well known that EA-equivalence is a special kind of CCZ-equivalence, and that CCZ-equivalence preserves the extended Walsh spectrum and the differential spectrum (but not for algebraic degree) [@CCZ].

$(n,m)$-functions with Maximal Number of Bent Components
========================================================

In this section, we will determine the tight upper bound for the number of bent components of general $(n,m)$-functions, where $n$ is even and $m\geq \frac{n}{2}$, and present a trivial construction of $(n,m)$-functions which reach this bound.

[@Bose-Burton] \[Bose-Burton\] Let $\mathbb{F}_{q}$ be the finite field of order $q=p^s$ and $PG(n,q)$ the projective space of dimension $n$ over $\mathbb{F}_{q}$. A set $S$ of points in $PG(n,q)$ that meets all $(n-k)$-dimensional subspaces of $PG(n,q)$ has at least $\frac{q^{k+1}-1}{q-1}$ points with equality if and only if $S$ is a subspace of dimension $k$.

As it has been pointed out by the authors of [@Pott], one can get the following Lemma when applying Theorem \[Bose-Burton\] to the case of $p=2$.

\[key\][@Pott Corollary 1]. A set $S$ of elements in $\mathbb{F}_{2}^{n}\backslash\{0\}$ meeting all $(n+1-k)$-dimensional subspaces of $\mathbb{F}_{2}^{n}$ has at least $2^k-1$ elements with equality if and only if $S\cup \{0\}$ is a $k$-dimensional subspace of $\mathbb{F}_{2}^{n}$.

\[number\] Let $n=2k$, $m$ be positive integers with $m\geq k$, and $F$ an $(n,m)$-function. Denote by $S=\{v \in\mathbb{F}_{2}^{m}: x\mapsto \langle v,F(x)\rangle \text{is not bent}\}.$ Then $|S|\geq 2^{m-k}$, with equality if and only if $S$ is an $(m-k)$-dimensional subspace of $\mathbb{F}_{2}^{m}$. In particular, the maximal number of bent components of $F$ is $2^{m}-2^{m-k}$.

With similar arguments as in [@Pott Theorem 3], one can obtain the desired assertions. For the convenience of the readers, we give the proof here. If $|S|<2^{m-k}$, then there are at most $2^{m-k}-2$ nonzero elements $v$ for which $x\mapsto \langle v,F(x)\rangle$ is not bent. Due to Lemma \[key\], $S$ cannot meet all subspaces of dimension $m+1-(m-k)=k+1$, hence there exists some subspace $T$ of dimension $k+1$ disjoint from $S\backslash \{0\}$. Then we have $T\cap (S\backslash \{0\})=\emptyset$, and hence $T\subseteq \mathbb{F}_{2}^{m} \backslash  (S\backslash \{0\})$. Therefore $T\subseteq \{v \in\mathbb{F}_{2}^{m}: x\mapsto \langle v,F(x)\rangle \text{~is bent}\}\cup\{0\},$ that is, there is a vectorial bent function from $\mathbb{F}_{2}^{n}$ to $\mathbb{F}_{2}^{k+1}$, which is impossible due to Nyberg’s theorem [@Nyb] on vectorial bent function which says that vectorial bent $(n,m)$-functions exist if and only if $n$ is even and $m\leq \frac{n}{2}$.

It is well known that the algebraic degree of a bent function in $n$ variables is upper bounded by $n/2$. This upper bound is tight, and is valid for vectorial bent functions as well. In fact, it is also true for all $(n,m)$-functions with maximum number of bent components.

\[deg\] Let $n=2k$, $m\geq k$ be positive integers. Let $F$ be an $(n,m)$-function with maximum number of bent components, then its algebraic degree is at most $k$.

For any non-bent component $f$ of $F$, let $g$ be a bent component, then by Theorem \[number\] $f+g$ is bent. One then immediately gets the desired assertion by the upper bound for the algebraic degree of bent functions.

For any vectorial bent $(n,k)$-function $F(x)$ ($n=2k$), with the inclusion map $i: \mathbb{F}^{k}_{2}\rightarrow \mathbb{F}^{m}_{2}$, $a\mapsto (a,0)$, it can also be regarded as an $(n,m)$-function which can be easily seen to have the maximal number $2^{m}-2^{m-k}$ of bent components. For this reason, in this paper we call such $(n,m)$-function $G(x)=(F(x),0)$ trivial.

As it has been pointed out by Pott et al., for an $(n,n)$-function $F$ with maximal number of bent components, it can produce many vectorial bent $(n,k)$-functions [@Pott Proposition 3]. Explicitly, if ${\rm Tr}^{n}_{1}(\alpha F(x))$ is bent for any $\alpha \in \mathbb{F}_{2^{n}}\backslash \mathbb{F}_{2^{k}}$, then ${\rm Tr}^{n}_{k}(\alpha F(x))$ is a vectorial bent function for any $\alpha \in \mathbb{F}_{2^{n}}\backslash \mathbb{F}_{2^{k}}$. With this observation, we revisit the following $(n,n)$-function $F(x)$ which is essentially due to Leander and Kholosha [@Leander-Kholosha].

[**Example 1.**]{} Let $n=2k$, $F(x)=\sum\limits^{2^r-1}_{i=1}x^{(i2^{k-r}+1)(2^k-1)+1}$ with $1 \leq r\leq k$, and ${\rm gcd}(r,k)=1$. It has been observed by Li et al. that, for any $\alpha \in \mathbb{F}_{2^{n}}\backslash \mathbb{F}_{2^{k}}$, ${\rm Tr}^{n}_{1}(\alpha F(x))$ is bent [@Li2013 Theorem 2]. Thus, by Theorem \[number\], $F$ has $2^{n}-2^k$ bent components, and ${\rm Tr}^{n}_{1}(\alpha F(x))$ is bent if and only if $\alpha \in \mathbb{F}_{2^{n}}\backslash \mathbb{F}_{2^{k}}$. One will see that $F(x)$ is in fact a vectorial bent $(n,k)$-function. Indeed, for $1\leq i\leq 2^{r}-1$ denote $(i2^{k-r}+1)(2^k-1)+1$ by $d_{i}$, one has $F(x)=x^{(2^{k-1}+1)(2^k-1)+1}+\sum\limits^{2^{r-1}-1}_{i=1}(x^{d_{i}}+x^{d_{i}2^{k}})$. Note that $2(1+(2^{k-1}+1)(2^k-1))\equiv 2^k+1~{\rm mod}~(2^{2k}-1)$, the element $F(x)$ belongs to $\mathbb{F}_{2^k}$ for any $x\in \mathbb{F}_{2^n}$. Choosing $\alpha\in \mathbb{F}_{2^{n}}$ such that $\alpha+\alpha^{2^k}=1$, then ${\rm Tr}^{n}_{k}(\alpha F(x))=F(x)$ is a vectorial bent function by [@Pott Proposition 3]. This is why $F(x)$ can have the maximal number of bent components if one had known that $F(x)$ is a vectorial bent $(n,k)$-function in advance, and in our words $F(x)$ is trivial.

Below we will examine the case of the power $(n,n)$-functions, and give an observation on when it admits the maximal number of bent components. It turns out that if this is the case, it is trivial, i.e., it must be a vectorial bent $(n,k)$-function. Note that for any such $(n,n)$-function $F(x)$, let $S(F)=\{v\in \mathbb{F}_{2^{n}}~|~{\rm Tr}^{n}_{1}(v F(x)) \text{ is not bent} \}$, $S$ is a $k$-dimensional subspace of $\mathbb{F}_{2^{n}}$. Then by the fact that $S$ is isomorphic to $\mathbb{F}_{2^{k}}\subseteq \mathbb{F}_{2^{n}}$ as the vector spaces over $\mathbb{F}_{2}$, one can easily see that $F(x)$ is EA-equivalent to a function $G(x)$ with $S(G)=\mathbb{F}_{2^{k}}$. It indicates that one only needs to consider those functions $G$ with $S(G)=\mathbb{F}_{2^{k}}$ in the sense of EA-equivalent.

Let $n=2k$, $s$ be positive integers, and $F(x)=x^s$ an $(n,n)$-function. If ${\rm Tr}^{n}_{1}(\alpha F(x))$ is a Boolean bent function for any $\alpha \in \mathbb{F}_{2^{n}}\backslash \mathbb{F}_{2^{k}}$ ($S(F)=\mathbb{F}_{2^{k}}$), then $2^k+1~|~s$, and $d=\frac{s}{2^k+1}$ satisfying that ${\rm gcd}(d,2^{k}-1)=1$. In particular, $F(x)$ admits the maximal number of bent components if and only if it is a vectorial bent $(n,k)$-function.

Assume to the contrary, $2^k+1\not|s$, then there exists an element $x_{0}^s\not\in \mathbb{F}_{2^{k}}, $ where $x_{0}\in \mathbb{F}^{\ast}_{2^{n}}$. We have $$\begin{aligned}
W_{F}(\lambda,x_{0}^s)
             &\!=\!& \sum\limits_{x\in \mathbb{F}_{2^{n}}}(-1)^{{\rm Tr}^{n}_{1}((x_{0}x)^s+\lambda x)}\\
             &\!=\!&  \sum\limits_{x\in \mathbb{F}_{2^{n}}}(-1)^{{\rm Tr}^{n}_{1}(x^s)+{\rm Tr}^{n}_{1}(\lambda x^{-1}_{0}x)}\\
             &\!=\!& W_{F}(\lambda x_{0}^{-1},1).
             \end{aligned}$$ However, by the assumption and Theorem \[number\], one has ${\rm Tr}^{n}_{1}(\alpha F(x))$ is not bent for any $\alpha\in \mathbb{F}_{2^{k}}$, and then the equation that $W_{F}(\lambda,x_{0}^s)=W_{F}(\lambda x_{0}^{-1},1)$ must induce a contradiction because of $x_{0}^{s}\in \mathbb{F}_{2^{n}}\backslash \mathbb{F}_{2^{k}} $, and $1\in \mathbb{F}_{2^{k}}$.

Denote $\frac{s}{2^k+1}$ by $d$, and $x^{2^{k}}$ by $\overline{x}$, we shall show ${\rm gcd}(d,2^{k}-1)=1$. Now $F(x)=x^s=x^{d(2^{k}+1)}=(x\overline{x})^{d}.$ Let $\gamma \in  \mathbb{F}_{2^{n}}\backslash \mathbb{F}_{2^{k}}$, then the elments $x  \in  \mathbb{F}_{2^{n}}$ can be written uniquely in the form $a+b\gamma$ with $a, b \in \mathbb{F}_{2^{k}}.$ We have

$$\begin{aligned}
W_{F}(\lambda,a+b\gamma)
             &\!=\!&\sum\limits_{x\in \mathbb{F}_{2^{n}}}(-1)^{{\rm Tr}^{n}_{1}((a+b\gamma)x^s)+{\rm Tr}^{n}_{1}(\lambda x)}\\
             &\!=\!&\sum\limits_{x\in \mathbb{F}_{2^{n}}}(-1)^{{\rm Tr}^{n}_{1}((ax^s+b\gamma x^s)+{\rm Tr}^{n}_{1}(\lambda x)}\\
             &\!=\!&\sum\limits_{x\in \mathbb{F}_{2^{n}}}(-1)^{{\rm Tr}^{n}_{1}(b\gamma x^s)+{\rm Tr}^{n}_{1}(\lambda x)}~(\text{recall~that}~ax^s\in \mathbb{F}_{2^{k}}).\\
             \end{aligned}$$

Let $U=\{x\in \mathbb{F}_{2^{n}} ~|~x\overline{x}=1\}$, then for any $x\in \mathbb{F}^{\ast}_{2^{n}}$, it can be uniquely written as $x=yu$, where $y\in \mathbb{F}^{\ast}_{2^{k}}$, and $u\in U$. We have

$$\begin{aligned}
W_{F}(0,a+b\gamma)
             &\!=\!&\sum\limits_{y\in \mathbb{F}^{\ast}_{2^{k}},u\in U}(-1)^{{\rm Tr}^{n}_{1}(b\gamma (yu)^s)}+1\\
             &\!=\!&\sum\limits_{u\in U}\sum\limits_{y\in \mathbb{F}^{\ast}_{2^{k}}}(-1)^{{\rm Tr}^{n}_{1}(b\gamma y^{2d})}+1~(\text{recall~ that~} u^s=1,y^s=(y\overline{y})^d=y^{2d})\\
             &\!=\!&\sum\limits_{u\in U}\sum\limits_{y\in \mathbb{F}_{2^{k}}}(-1)^{{\rm Tr}^{n}_{1}(b\gamma y^{2d})}-2^{k}\\
             &\!=\!&\sum\limits_{u\in U}\sum\limits_{y\in \mathbb{F}_{2^{k}}}(-1)^{{\rm Tr}^{k}_{1}(b(\gamma+\overline{\gamma}))y^{2d})}-2^{k}.\\
             \end{aligned}$$

Denote $\sum\limits_{y\in \mathbb{F}_{2^{k}}}(-1)^{{\rm Tr}^{k}_{1}(b(\gamma+\overline{\gamma}))y^{2d}}$ by $A$, for $b\neq 0$, we have $W_{F}(0,a+b\gamma)=(2^k+1)A-2^k=2^{k}(A-1)+A=\pm 2^{k}$. It imply that $(2-A)2^{k}=A$ or $A(2^{k}+1)=0$. If the former holds, then $A\neq 2$, and by the fact $\frac{A}{2-A}=2^k$ is an integer we have $A=1$. However, it would imply that $2^{k}(2-A)=2^{k}=A=1$, a contradiction with the assumption that $k$ is a positive integer. Then $A=0$, and it means that $\sum\limits_{y\in \mathbb{F}_{2^{k}}}(-1)^{{\rm Tr}^{k}_{1}(b(\gamma+\overline{\gamma}))y^{2d}}=0$ for any $b\in \mathbb{F}^{\ast}_{2^{k}}$. Noting that $(\gamma+\overline{\gamma})x$ is a bijective map from $\mathbb{F}^{\ast}_{2^{k}}$ to $\mathbb{F}^{\ast}_{2^{k}}$, we have for any $b\in \mathbb{F}^{\ast}_{2^{k}}$, $\sum\limits_{y\in \mathbb{F}_{2^{k}}}(-1)^{{\rm Tr}^{k}_{1}(by^{d})}=0$. Therefore, the function $y^d$ is a permutation on $\mathbb{F}_{2^{k}}$, that is, ${\rm gcd}(d,2^{k}-1)=1$. The last assertion can be seen from the fact that $F(x)\in \mathbb{F}_{2^{k}}$ for any $x\in \mathbb{F}_{2^{n}}$ and [@Pott Proposition 3].

Let $n=2k$, $F(x)=x^{d(2^k+1)}$, ${\rm gcd}(d,2^k-1)=1$. It is easy to see the following two facts: 1) for any $\alpha \in \mathbb{F}_{2^{k}}$, ${\rm Tr}^{n}_{1}(\alpha F(x))$ is not bent; 2) the Walsh spectrums are the same for ${\rm Tr}^{n}_{1}(\alpha F(x))$, ${\rm Tr}^{n}_{1}(\beta F(x))$, where $\alpha,\beta \in \mathbb{F}_{2^{n}} \backslash \mathbb{F}_{2^{k}}$. Therefore, it suffices to consider only one component function ${\rm Tr}^{n}_{1}(\alpha F(x))$ for $\alpha \in \mathbb{F}_{2^{n}}\backslash \mathbb{F}_{2^{k}}$ when one wants to compute the number of the bent components of $F(x)$. As it has been shown in [@Hell09] by Helleseth et al., if $d(2^l+1)\equiv 2^i~{\rm mod} (2^k-1)$ for some integers $l\geq 1$, $i\geq 0$ (in this case ${\rm gcd}(d,2^k-1)=1$), for any $\alpha \in \mathbb{F}_{2^{n}}\backslash \mathbb{F}_{2^{k}}$, $\{W_{F}(\lambda,\alpha)~|~ \lambda \in \mathbb{F}^{\ast}_{2^n} \}$ takes on either exactly three or four values depending on whether $l$ and $n$ are coprime or not. It means that for those $d$, $F(x)$ does not have any bent components. Note that if $l=0$, and $d(2^l+1)\equiv 2^i~{\rm mod} (2^k-1)$, then $d \equiv 2^j~{\rm mod} (2^k-1)$ for some $j$. In this case, $F(x)=x^{d(2^k+1)}=x^{2^{i}(2^k+1)}$ has $2^n-2^k$ bent components (Gold function), and $\{W_{F}(\lambda,\alpha)~|~ \lambda \in \mathbb{F}^{\ast}_{2^n} \}$ takes on exactly two values. Based on those observations above, for $n>8$, they conjectured that if $\{W_{F}(\lambda,\alpha)~|~ \lambda \in \mathbb{F}^{\ast}_{2^n} \}$ takes on at most four values, then there must $l\geq0$, and $i\geq 0$ such that $d(2^l+1)\equiv 2^i~{\rm mod} (2^k-1)$, see the arguments above Remark 3 in [@Hell09] for more information.

It is an interesting and important problem to determine all the exponents $d$ such that $F(x)=x^{d(2^k+1)}$ has some bent components. Inspired by the above arguments, one may expect that $d=2^{i}$ are the only ones.

[**Open Problem 1.**]{} Let $n=2k$, $d$ be a positive integer such that ${\rm gcd}(d,2^k-1)=1$. To show that if the $(n,n)$-function $F(x)=x^{d(2^k+1)}$ has some bent components, then $d \equiv 2^i~{\rm mod}~(2^k-1)$ for some $i\geq 0$.

Nontrivial $(n, m)$-functions with maximal number of bent components and their properties
=========================================================================================

It has been found that for the trivial $(n,m)$-functions with maximal number of bent components, their differential spectrum takes two values $0$ and $2^k$ only, and the Walsh spectrum takes the values $0, \pm2^k$ and $2^{2k}$ only. In this section, we are interested in the constructions of nontrivial $(n,m)$-functions with maximal number of bent components. Below we will present in bivariate form a large class of such functions, whose bent components belong to the Maiorana-McFarland class $\mathcal{M}$ of bent functions, and in univariate form a class of such functions which covers all the previously known nontrivial ones.

[**A. A nontrivial construction** ]{}

The following theorem gives a large class of nontrivial $(n,m)$-functions with maximal number of bent components.

\[keythm-1\] Let $m, k$ be two positive integers such that $m \geq k$. Let $G(x,y): \mathbb{F}_{2^{k}}\times \mathbb{F}_{2^{k}}\rightarrow\mathbb{F}_{2^{k}}\times \mathbb{F}_{2^{m-k}}$ be defined by $(x,y)\mapsto (x^{2^i}\pi(y)+g(y), h(y))$, where $\pi(y)$ is a permutation over $\mathbb{F}_{2^{k}}$, and $g(y)$ and $h(y)$ are arbitrary functions from $\mathbb{F}_{2^{k}}$ to $\mathbb{F}_{2^{k}}$ and to $\mathbb{F}_{2^{m-k}}$, respectively. Then for any $(0,0)\neq (u,v) \in  \mathbb{F}_{2^{k}}\times \mathbb{F}_{2^{m-k}}$, the function $\langle (u,v),G(x,y)\rangle$ is a bent component of $G$ if and only if $u\neq 0$. In particular, the function $G$ admits the maximal number $2^{m}-2^{m-k}$ of bent components.

For any $(0,0)\neq (u,v) \in  \mathbb{F}_{2^{k}}\times \mathbb{F}_{2^{m-k}}$, we have $\langle (u,v), G(x,y)\rangle=\langle u,
x^{2^{i}}\pi(y)+g(y)\rangle+\langle v,h(y)\rangle={\rm Tr}^{k}_{1}(u x^{2^{i}}\pi(y))+{\rm Tr}^{k}_{1}(u g(y))+{\rm Tr}^{m-k}_{1}(vh(y)):=f(x,y)$. If $u\neq 0$, then $f(x,y)$ is in the class $\mathcal{M}$ of bent functions. Hence $G$ has at least $(2^k-1)2^{m-k}=2^m-2^{m-k}$ bent components. While according to Theorem \[number\], the number of bent components is at most $2^m-2^{m-k}$. Hence $f$ is bent if and only if $u\neq 0$, and $G$ has the maximal number of bent components.

Below we consider the differential spectrum and Walsh spectrum of the functions given by Theorem \[keythm-1\].

\[delta-1\] Let $G(x,y)=(x^{2^i}\pi(y)+g(y),h(y))$, where $\pi(y)$ is a permutation over $\mathbb{F}_{2^{k}}$, and $g(y)$ and $h(y)$ are arbitrary $(k,k)$-function and $(k, m-k)$-function respectively. Then the differential spectrum of the function $G$ is given by $$\begin{aligned}
\delta_{G}((u,v),(a,b))\!= \! \begin{cases} 0, &\text{if ~} v\!=\!0 \text{~and~ } b\!\neq\! 0,\\
2^{k}, &\text{if ~} v\!=\!0 \text{~and~ } b\!=\!0, \\  \delta_{h}(v,b),  &\text{otherwise. }
\end{cases}\end{aligned}$$ In particular, $G$ is differentially $2^k$-uniform.

We have $$\begin{aligned}
&&G(x,y)\!+\!G(x\!+\!u,y\!+\!v)\\
&\!=\!&(x^{2^{i}}\pi(y)+g(y),h(y))\!+\!(x\!+\!u)^{2^{i}}\pi(y\!+\!v)+g(y\!+\!v),h(y\!+\!v)) \\
             &\!=\!&(x^{2^{i}}\pi(y)\!+\!(x\!+\!u)^{2^{i}}\pi(y\!+\!v)\!+\!g(y)+\!g(y\!+\!v),h(y)\!+\!h(y\!+\!v))\\
             &\!=\!&((\pi(y)\!+\!\pi(y\!+\!v))x^{2^{i}}\!+\!u^{2^{i}}\pi(y\!+\!v)+\!g(y)+\!g(y\!+\!v),h(y)\!+\!h(y\!+\!v)).
             \end{aligned}$$

Then $G(x,y)+G(x+u,y+v)=(a,b)$ is equivalent to $$\begin{aligned}
&((\pi(y)\!+\!\pi(y\!+\!v))x^{2^{i}}\!+\!u^{2^{i}}\pi(y\!+\!v)+\!g(y)+\!g(y\!+\!v)\!=\!a,\label{eq1}\\
&h(y)\!+\!h(y\!+\!v)\!=\!b. \label{eq2}\end{aligned}$$ If $v=0$ (and then $u\neq 0$) and $b=0$, then (\[eq2\]) holds for any $y\in \mathbb{F}_{2^{k}}$. Note that (\[eq1\]) is reduced to $u^{2^{i}}\pi(y)=a$, which has exactly one solution $y=\pi^{-1}(au^{-2^{i}})$. Therefore, the solutions of $G(x,y)+G(x+u,y+v)=(a,b)$ are exactly those $(x,\pi^{-1}(au^{-2^{i}}))$ with $x\in \mathbb{F}_{2^{k}}$, and thus $\delta_{G}((u,0),(a,0))=2^{k}$.

If $v=0$ and $b\neq 0$, (\[eq2\]) has no solutions, then $\delta_{G}((u,0),(a,b))=0$.

When $v\neq 0$, one has $\pi(y)+\pi(y+v)\neq 0$, since $\pi$ is a permutation function. Then Eq. (\[eq1\]) can be rewritten as $x^{2^{i}}=(a+u^{2^{i}}\pi(y+v)+g(y)+g(y+v))[\pi(y)+\pi(y+v)]^{-1}$, so that all the solutions to $G(x,y)+G(x+u,y+v)=(a,b)$ are $(((a+u^{2^{i}}\pi(y+v)+g(y)+g(y+v))[\pi(y)+\pi(y+v)]^{-1})^{2^{-i}},y)$, where $y$ satisfies (\[eq2\]) . Therefore in this case $\delta_{G}((u,v),(a,b))=\delta_{h}(v,b)$.

One can see that at least most of the functions given by Theorem \[keythm-1\] are [CCZ]{}-inequivalent to those trivial ones, since they have different differential spectrum. In fact, it is easy to see that the differential spectrum of a trivial function takes two values $0$ and $2^k$ only, and their Walsh spectrum takes the values $0, \pm2^k$ and $2^{2k}$ only.

\[walsh-1\] Let $G(x,y)=(x^{2^i}\pi(y)+g(y),h(y))$, where $\pi(y)$ is a permutation over $\mathbb{F}_{2^{k}}$, and $g(y)$ and $h(y)$ are arbitrary $(k,k)$-function and $(k, m-k)$-function respectively. Then for any $(a,b)\in \mathbb{F}_{2^{k}}^2, (0,0)\neq(u,v)\in \mathbb{F}_{2^{k}}\times\mathbb{F}_{2^{m-k}}$, the Walsh spectrum of $F$ satisfies $$\begin{aligned}
W_{G}((a,b),(u,v))\!=\!
\begin{cases}\!\pm\!~2^k, &{\rm~if~}u\!\neq\! 0,\\0, &{\rm~if~}u\!=\!0, a\neq 0,\\2^{k}W_{h}(b,v), &{\rm~otherwise.}
\end{cases}\end{aligned}$$ Moreover, $G$ is plateaued if and only if $h$ is plateaued.

Let $(a,b) \in \mathbb{F}_{2^{k}}\times \mathbb{F}_{2^{k}}$. For any $(0, 0)\neq (u,v) \in  \mathbb{F}_{2^{k}}\times \mathbb{F}_{2^{m-k}}$, we have $$\begin{aligned}
\langle (u,v), G(x,y)\rangle &\!=\!& \langle u,
x^{2^{i}}\pi(y)\!+\!g(y)\rangle\!+\!\langle v, h(y)\rangle\\
& \!=\!& {\rm Tr}^{k}_{1}(u x^{2^{i}}\pi(y))\!+\!{\rm Tr}^{k}_{1}(u g(y))\!+\!{\rm Tr}^{m-k}_{1}(vh(y)):=f(x,y).\end{aligned}$$ One has $${\begin{array}{lll}W_{f}(a,b)&\!= \! \sum\limits_{(x,y)\in \mathbb{F}_{2^{k}}\times \mathbb{F}_{2^{k}}}(\!-\!1)^{f(x,y)\!+\!{\rm Tr}^{k}_{1}(ax\!+\!by)}  \\
             &\!= \!\sum\limits_{y\in  \mathbb{F}_{2^{k}} }(\!-\!1)^{{\rm Tr}^{m-k}_{1}(vh(y))+{\rm Tr}^{k}_{1}(ug(y))\!+\!{\rm Tr}^{k}_{1}(by)}\sum\limits_{x\in  \mathbb{F}_{2^{k}}}(\!-\!1)^{{\rm Tr}^{k}_{1}(((u\pi(y))^{2^{k-i}}\!+\!a)x)}\\
             &\!=\! 2^{k}\sum\limits_{u\pi(y)=a^{2^i}}(\!-\!1)^{{\rm Tr}^{m-k}_{1}(vh(y))\!+\!{\rm Tr}^{k}_{1}(by)+{\rm Tr}^{k}_{1}(ug(y))}. \\
             \end{array}}$$ By Theorem \[keythm-1\], $f(x,y)$ is bent if and only if $u\neq 0$. Hence when $u\neq 0$ it holds $W_{G}((a,b),(u,v))=\pm 2^k$.

If $u=0$ and $v\neq 0$, then for $a=0$, the solutions to $u\pi(y)=a^{2^i}$ are exactly all $y$ in $\mathbb{F}_{2^{k}}$. Therefore in this case $W_{f}(a,b)=2^{k}\sum\limits_{y\in\mathbb{F}_{2^{k}}}(-1)^{{\rm Tr}^{m-k}_{1}(vh(y))+{\rm Tr}^{k}_{1}(by)}=2^{k}W_{h}(b,v).$ While for $a\neq 0$, there is no solution to $u\pi(y)=a^{2^i}$. Hence $W_{f}(a,b)=0$.

[**B. More on $(n,n)$-functions**]{}

In [@Pott], Pott et al. presented in univariate form an infinite class of $(2k,2k)$-functions $x^{2^{i}}(x+x^{2^{k}})$ with the maximal number of bent components. They noticed that these functions are of the form $F(x)=x^{2^{i}}\mathcal{L}(x)$ for some linear mapping $\mathcal{L}(x)=x+x^{2^{k}}$. Then they raised an open question (Question 2 in [@Pott]) of determining all those linear mappings $\mathcal{L}$ over $\mathbb{F}_{2^{2k}}$ such that the function $x\mathcal{L}(x)$ has the maximal number of bent components. In the following, we completely determine under which conditions a large subclass of such $(n,n)$-functions will have the maximum number of bent components, and thus partially answer the open question. [ ]{}

It should be also noted that the $(n,n)$-functions constructed by [@MZTZ; @Pott] are all quadratic. The proofs for that those functions have the maximum number of bent components are long, and they rely on the theory of quadratic forms. It seems that to find such functions, perhaps one has to examine the quadratic functions first. However, in this paper, we break this impression and provide a direct and much simpler proof for the maximality of the number of bent components of the functions considered in the following theorem, which cover all the nontrivial functions in [@MZTZ; @Pott] according to the arguments of Remark \[cover\] below.

\[keythm-2\] Let $n=2k$ be a positive integer, $e$ a positive divisor of $k$. Let $F^{i}(x)=x^{2^{i}}h({\rm Tr}^{n}_{e}(x))$, where $i$ is a nonnegative integer, $h:\mathbb{F}_{2^{e}}\rightarrow \mathbb{F}_{2^{e}}$ is an arbitrary function. Then $F^{i}$ has the maximal number of bent components if and only if $e=k$ and $\pi$ is a permutation over $\mathbb{F}_{2^{e}}$. Moreover, when $e=k$ and $h$ is a permutation over $\mathbb{F}_{2^{e}}$, for any $\alpha \in \mathbb{F}_{2^{n}}$, ${\rm Tr}^{n}_{1}(\alpha F^{i})$ is a bent component of $F^{i}$ if and only if $\alpha \not\in \mathbb{F}_{2^{k}}$. For other cases, $F^i$ does not have any bent component.

For any $x\in\mathbb{F}_{2^{n}}$, write $x=g+y$ such that $y\in \mathbb{F}_{2^{k}}$ and $g\in\mathcal{G}$, where $\mathcal{G}$ is a set of representatives of cosets of $\mathbb{F}_{2^{k}}$ in $\mathbb{F}_{2^{n}}$, say $\mathbb{F}_{2^{n}}=\cup_{g\in \mathcal{G}}(g+\mathbb{F}_{2^{k}})$ and it is a disjoint union. Denote $x^{2^{k}}$ by $\overline{x}$, then we have for any $(\beta, \alpha) \in \mathbb{F}_{2^{n}}\times\mathbb{F}_{2^{n}}^*$ that $W_{F^{i}}(\beta,\alpha)$ equals $$\begin{aligned}
&&\sum\limits_{x\in \mathbb{F}_{2^{n}}}(-1)^{{\rm Tr}^{n}_{1}(\alpha F^{i}(x))+{\rm Tr}^{n}_{1}(\beta x)} \\
&=&\sum\limits_{x\in \mathbb{F}_{2^{n}}}(-1)^{{\rm Tr}^{k}_{1}({\rm Tr}^{n}_{k}(\alpha F^{i}(x)))+{\rm Tr}^{k}_{1}({\rm Tr}^{n}_{k}(\beta x))} \\
&=&\sum\limits_{g\in \mathcal{G}, y\in  \mathbb{F}_{2^{k}}}(-1)^{{\rm Tr}^{k}_{1}(h({\rm Tr}^{k}_{e}(g+\overline{g}))((\alpha g^{2^{i}}+\overline{\alpha g^{2^{i}}})+(\alpha + \overline{\alpha})y^{2^{i}}))+{\rm Tr}^{k}_{1}((\beta g+\overline{\beta g})+(\beta+\overline{\beta})y)}\\
&=&\sum\limits_{g\in\mathcal{G}}(-1)^{{\rm Tr}^{k}_{1}(h({\rm Tr}^{k}_{e}(g+\overline{g}))(\alpha g^{2^{i}}+\overline{\alpha g^{2^{i}}})+(\beta g+\overline{\beta g}))}\sum\limits_{y\in \mathbb{F}_{2^{k}}}(-1)^{{\rm Tr}^{k}_{1}(((\alpha+\overline{\alpha})h({\rm Tr}^{k}_{e}(g+\overline{g})))^{2^{k-i}}+(\beta+\overline{\beta}))y)}\\
&=&2^{k}\sum\limits_{(\alpha+\overline{\alpha})\pi({\rm Tr}^{k}_{e}(g+\overline{g}))=(\beta+\overline{\beta})^{2^{i}}}(-1)^{{\rm Tr}^{k}_{1}(h({\rm Tr}^{k}_{e}(g+\overline{g}))(\alpha g^{2^{i}}+\overline{\alpha g^{2^{i}}})+(\beta g+\overline{\beta g}))}.\end{aligned}$$

If $\alpha+\overline{\alpha}=0$, say $\alpha \in \mathbb{F}_{2^{k}}$, let $\beta$ be such that $\beta+\overline{\beta}\neq 0$, then $W_{F^{i}}(\beta,\alpha)=0$ as $(\alpha+\overline{\alpha})h({\rm Tr}^{k}_{e}(g+\overline{g}))=(\beta+\overline{\beta})^{2^{i}}$ has no solution. It implies that $\langle \alpha ,F^{i}\rangle$ is not bent. Therefore, by Theorem \[number\], $F^{i}$ has the maximal number of bent components if and only if for any $\alpha\not\in \mathbb{F}_{2^{k}}$, $\langle \alpha ,F^{i}\rangle$ is bent.

Now suppose $\alpha\not\in \mathbb{F}_{2^{k}}$, then $(\alpha+\overline{\alpha})h({\rm Tr}^{k}_{e}(g+\overline{g}))=(\beta+\overline{\beta})^{2^{i}}$ is equivalent to $h({\rm Tr}^{k}_{e}(g+\overline{g}))=(\beta+\overline{\beta})^{2^{i}}(\alpha+\overline{\alpha})^{-1}$. If $e=k$ and $h$ is a permutation over $\mathbb{F}_{2^{e}}=\mathbb{F}_{2^{k}}$, then the equation above reduces to $g+\overline{g}=h^{-1}((\beta+\overline{\beta})^{2^{i}}(\alpha+\overline{\alpha})^{-1})$. However, the mapping $g\mapsto g+\overline{g}$ is a bijection from $\mathcal{G}$ to $\mathbb{F}_{2^{k}}$, hence there is exactly one solution $g$ to the equation. It indicates that $W_{F^{i}}(\beta,\alpha)=\pm 2^k$ for any $\beta$, and thus $\langle \alpha ,F^{i}\rangle$ is bent.

If $e<k$, then for any fixed $\alpha \not\in \mathbb{F}_{2^{k}}$, by the fact $\mathbb{F}_{2^{e}}\subsetneqq \mathbb{F}_{2^{k}}$ and $(\alpha+\overline{\alpha})^{-1}({\rm Tr}^{n}_{k}(x))^{2^{i}}$ is surjective from $\mathbb{F}_{2^{n}}$ to $\mathbb{F}_{2^{k}}$, there must exist $\beta_{0}\in \mathbb{F}_{2^{n}}$ such that $(\alpha+\overline{\alpha})^{-1}(\beta_{0}+\overline{\beta_{0}})^{2^{i}}\not\in \mathbb{F}_{2^{e}}$. However, $h$ is a map from $\mathbb{F}_{2^{e}}$ to $\mathbb{F}_{2^{e}}$, it implies that $W_{F^{i}}(\beta_{0},\alpha)=0$, and hence $\langle \alpha ,F^{i}\rangle$ is not bent. Therefore $F^{i}$ cannot have any bent component if $e<k$.

Finally suppose $e=k$, and $h$ is not a permutation over $\mathbb{F}_{2^{e}}$, the equation reduces to $h(g+\overline{g})=(\beta+\overline{\beta})^{2^{i}}(\alpha+\overline{\alpha})^{-1}$. However, there must exist $\gamma \in \mathbb{F}_{2^{k}}$ such that its pre-image set $h^{-1}(\gamma)$ is empty. Then by the arguments as above, for any fixed $\alpha \not\in \mathbb{F}_{2^{k}}$, there must exist $\beta\in \mathbb{F}_{2^{n}}$ such that $(\alpha+\overline{\alpha})^{-1}(\beta+\overline{\beta})^{2^{i}}=\gamma$, and then $W_{F^{i}}(\beta,\alpha)=0$. Therefore $F^{i}$ cannot have any bent component.

Let $n=2k$, Proposition 3 in [@Pott] says that for an $(n,n)$-function $F$, if ${\rm Tr}^{n}_{1}(\alpha F(x))$ is a bent function for any $\alpha\in \mathbb{F}_{2^{n}}\backslash \mathbb{F}_{2^{k}}$, then ${\rm Tr}^{n}_{k}(\alpha F(x))$ is a vectorial bent function for any $\alpha\in \mathbb{F}_{2^{n}}\backslash \mathbb{F}_{2^{k}}$. By this observation together with Theorem \[keythm-2\], one can get the following result.

Let $n=2k$ be a positive integer, $i$ a nonnegative integer. Let $h$ be a permutation over $\mathbb{F}_{2^{k}}$. Then the function ${\rm Tr}^{n}_{k}(\alpha x^{2^{i}}h({\rm Tr}^{n}_{k}(x)))$ is vectorial bent for any $\alpha \not\in \mathbb{F}_{2^{k}}$.

The function $F^{i}(x)=x^{2^{i}}h({\rm Tr}^{n}_{k}(x))$, where $h$ is a permutation over $\mathbb{F}_{2^{k}}$, can possess a high algebraic degree. This class of functions provides the first nontrivial example of nonquadratic functions in univariate form with the maximal number of bent components. Some of such functions can reach the optimal algebraic degree $k$. For example, the algebraic degree of $x({\rm Tr}^{n}_{k}(x))^{2^{k-1}-1}$ is equal to $k$.

\[cover\] Let $h(x)=x$ for any $x\in \mathbb{F}_{2^{k}}$. Then $h$ is a permutation over $\mathbb{F}_{2^{k}}$, and the functions $F^{i}(x)$ are just the $(n,n)$-functions $x^{2^{i}}(x+x^{2^k})$ in [@Pott Theorem 4]. Note that for a linear map $\mathcal{L}(x)$ over $\mathbb{F}_{2^{k}}$, it is a permutation of $\mathbb{F}_{2^{k}}$ if and only if $\mathcal{L}(x)=0$ has exactly only one solution $x=0$. Let $h(x)=\mathcal{L}(x)$ be a linear permutation over $\mathbb{F}_{2^{k}}$, then the functions $F^{i}(x)$ are just the $(n,n)$-functions $H(x)$ in [@MZTZ Theorem 9] which is a main result of [@MZTZ].

Theorem \[keythm-2\] partially answers Open question 2 in [@Pott]. Indeed, if $\mathcal{L}(x)$ is of the form $L({\rm Tr}^{n}_{k}(x))$ with $L(x)$ a linear map over $\mathbb{F}_{2^{k}}$, then $F(x)=x\mathcal{L}(x)=xL({\rm Tr}^{n}_{k}(x))$ has the maximal number of bent components if and only if $L(x)$ is a permutation over $\mathbb{F}_{2^{k}}$. It is an interesting problem to find all such functions $\mathcal{L}$, and we leave it as another open problem here.

Conclusions
===========

We specified the bent components of an infinite class of $(n,m)$-functions in bivariate form $G(x,y)=(x^{2^{i}}\pi(y)+g(y),h(y)): \mathbb{F}_{2^{k}}\times \mathbb{F}_{2^{k}}\rightarrow\mathbb{F}_{2^{k}}\times \mathbb{F}_{2^{m-k}}$, here $\pi(y)$ is a permutation over $\mathbb{F}_{2^{k}}$, $g(y)$ is an arbitrary function from $\mathbb{F}_{2^{k}}$ to $\mathbb{F}_{2^{k}}$, and $h(y)$ is an arbitrary function from $\mathbb{F}_{2^{k}}$ to $\mathbb{F}_{2^{m-k}}$. This is the first time a class of nontrivial $(n,m)$-functions in bivariate form with maximum number of bent components were constructed.

For the $(n,n)$-function, $n=2k$, we consider two types of those functions. One is the power $(n,n)$-function $F(x)=x^s$, we showed that it admits the maximal number of bent components if and only if it is a vectorial bent $(n,k)$-function under a mild condition. The other one is of the form $F^{i}(x)=x^{2^{i}}h({\rm Tr}^{n}_{e}(x))$, where $e$ is any divisor of $k$ and $h: \mathbb{F}_{2^{e}}\rightarrow \mathbb{F}_{2^{e}}$. We showed that the functions $F^{i}(x)$ have maximum bent components if and only if $e=k$, and $h$ is a permutation over $\mathbb{F}_{2^{e}}$. An infinite class of vectorial bent functions of the form ${\rm Tr}^{n}_{k}(\alpha F^{i}(x))$ was specified, where $\alpha$ is a primitive element of $\mathbb{F}_{2^{n}}$.

[1]{}

T. P. Berger, A. Canteaut, P. Charpin, Y. Laigle-Chapuy, *On Almost Perfect Nonlinear Functions Over $F_{2^n}$*, IEEE Transactions on Information Theory, vol. 52, no. 9, pp. 4160-4170, 2006.

R. C. Bose, R. C. Burton, *A characterization of flat spaces in a finite geometry and the uniqueness of the Hamming and the MacDonald codes*, Journal of Combinatorial Theory, vol. 1, no. 1, pp. 96-104, 1966.

C. Carlet, *Boolean Functions for Cryptography and Error Correcting Codes*, In: Y. Crama, P. Hammer (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 257-397. Cambridge University Press, 2010.

C. Carlet, *Vectorial Boolean functions for cryptography*, Boolean Models and Methods in Mathematics, Computer Science, and Engineering, 134, pp. 398-469, 2010.

C. Carlet, P. Charpin, and V. Zinoviev, *Codes, bent functions and permutations suitable for DES-like cryptosystems*, Designs, Codes and Cryptography, vol. 15, no. 2, pp. 125-156, 1998. C. Carlet, S. Mesnager, *Four decades of research on bent functions, Designs, Codes and Cryptography*, vol. 78, no. 1, pp. 5-50, 2016. P. Charpin, J. Peng, *New links between nonlinearity and differential uniformity*, Finite Fields and Their Applications, vol. 56, pp. 188-208, 2019.

J. F. Dillon, *Elementary Hadamard difference sets*, Ph.D. dissertation, Univ. Maryland, 1974.

T. Helleseth, L. Hu, A. Kholosha, X. Zeng, N. Li, W. Jiang, *Period-different $m$-sequences with at most four-valued cross correlation*, vol. 55, no. 7, pp. 3305-3311, 2009.

G. Leander, A. Kholosha, *Bent functions with $2^r$ Niho exponents*, IEEE Transactions on Information Theory, vol. 52, no. 12, pp. 5529-5532, 2006.

N. Li, T. Helleseth, A. Kholosha, X. Tang, *On the walsh transform of a class of functions from niho exponents*, IEEE Transactions on Information Theory, vol. 59, no. 7, pp. 4662-4667, 2013.

M. Matsui, *Linear cryptanalysis method for DES cipher*, in Advances in Cryptology¡ªEUROCRYPT (Lecture Notes in Computer Science), vol. 765. Berlin, Germany: Springer-Verlag, pp. 386-397, 1993. R. L. McFarland, *A family of difference sets in non-cyclic groups*, Journal of Combinatorial Theory $A$, vol. 15, no. 1, pp. 1-10, 1973.

S. Mesnager, *Bent functions: fundamentals and results*, pp. 1-544, Springer, Switzerland, 2016.

S. Mesnager, F. R. Zhang, C. M. Tang, Y. Zhou, *Further study on the maximal number of bent components of vectorial functions*, to appear in Designs, Codes, and Cryptography, preprint: arxiv: 1801.06542v1, 2018.

A. Muratović-Ribić, E. Pasalic, S. Bajrić, *Vectorial bent functions from multiple terms trace functions*, IEEE Transactions on Information Theory, vol. 60, no. 2, pp. 1337-1347, 2014.

K. Nyberg, *Perfect nonlinear S-boxes*, in Advances in Cryptology¡ª EUROCRYPT (Lecture Notes in Computer Science), vol. 547. Berlin, Germany: Springer-Verlag, pp. 378-385, 1991.

J. Peng, C. H. Tan, *New explicit constructions of differentially 4-uniform permutations via special partitions of $\mathbb{F}_{2^{2k}}$*, Finite Fields and Their Applications, vol. 40, pp. 73-89, 2016.

A. Pott, E. Pasalic, A. Muratović-Ribić, S. Bajrić, *On the maximum number of bent components of vectorial functions*, IEEE Transactions on Information Theory, vol. 64, no.1, pp. 403-411, 2018.

O. S. Rothaus, *On ¡®bent¡¯ functions*, Journal of Combinatorial Theory $A$, vol. 20, no. 3, pp. 300-305, 1976.

[^1]: J. Peng, Y. Li, and J. Luo are with Mathematics and Science College of Shanghai Normal University, Shanghai, China, 200234, (E-mails: {jpeng,luojuan}@shnu.edu.cn, yanjlmath90@163.com). $^{\diamond}$ L. Zheng and H. Kan are with the Department of Computer Sciences, Fudan University, Shanghai, 200433, China; L. Zheng is also with School of Mathematics and Physics, University of South China, Hengyang, Hunan, 421001, China, (E-mails: zhenglijing817@163.com, hbkan@fudan.edu.cn).
