Further study on the maximum number of bent components of vectorial functions

In 2018, Pott et al. have studied in (IEEETrans Inf Theory 64(1):403-411, 2018) the maximum number of bent components of vectorial functions. They have presented many 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 functions 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 F-22k to F-22k by its univariate representation: alpha x(2i)(x + x(2k) + Sigma(rho)(j=1)gamma(j)x2(tj) + Sigma(rho)(j=1)gamma(j)x2(tj+k)) has the maximum number of bent components, where rho <= k. Further, we show that the differential spectrum of the function x(2i) (x + x(2k) + x(2t1) + x(2t1+k) + x(2t2) + x(2t2+k)) (where i, t(1), t(2) satisfy some conditions) is different from the binomial function Fi (x) = x(2i) (x+ x(2k)) presented in the article of Pott et al.