2018/01/21 by Sihem Mesnager, Mesnager, Sihem, Fengrong Zhang +5 · 1 citation
Computer Science · Medicine · #Coding theory and cryptography #Cancer Mechanisms and Therapy #Cryptographic Implementations and Security
paper · pdf · doi:10.48550/arxiv.1801.06542
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 \mathbbF22k to \mathbbF22k by its univariate representation: αx2i(x+x2k+∑j=1ργ(j)x^2tj +∑j=1ργ(j)x^2tj+k) has the maximum number of components bent functions, where ρ≤ k. Further, we show that the differential spectrum of the function x2i(x+x2k+x^2t1+x^2t1+k+x^2t2+x^2t2+k) (where i,t1,t2 satisfy some conditions) is different from the binomial function Fi(x)= x2i(x+x2k) presented in the article of Pott et al. Finally, we provide sufficient and necessary conditions so that the functions Tr12k(αx2i(Tr2ke(x)+∑j=1ργ(j)(Tr2ke(x))2j )) are bent.