{"title":"On vectorial functions with maximal number of bent components","authors":"Xianhong Xie, Yi Ouyang, Honggang Hu","doi":"10.1007/s10623-025-01569-0","DOIUrl":null,"url":null,"abstract":"<p>We study vectorial functions with maximal number of bent components in this paper. We first study the Walsh transform and nonlinearity of <span>\\(F(x)=x^{2^e}h(\\textrm{Tr}_{2^{2m}/2^m}(x))\\)</span>, where <span>\\(e\\ge 0\\)</span> and <i>h</i>(<i>x</i>) is a permutation over <span>\\({\\mathbb {F}}_{2^m}\\)</span>. If <i>h</i>(<i>x</i>) is monomial, the nonlinearity of <i>F</i>(<i>x</i>) is shown to be at most <span>\\( 2^{2\\,m-1}-2^{\\lfloor \\frac{3\\,m}{2}\\rfloor }\\)</span> and some non-plateaued and plateaued functions attaining the upper bound are found. If <i>h</i>(<i>x</i>) is linear, the exact nonlinearity of <i>F</i>(<i>x</i>) is determined. Secondly, we give a construction of vectorial functions with maximal number of bent components from known ones, thus obtain two new classes from the Niho class and the Maiorana-McFarland class. Our construction gives a quadratic vectorial function that is not equivalent to the known functions of the form <i>xh</i>(<i>x</i>), and also contains vectorial functions outside the completed Maiorana-McFarland class. Finally, we show that the vectorial function <span>\\(F: {\\mathbb {F}}_{2^{2m}}\\rightarrow {\\mathbb {F}}_{2^{2m}}\\)</span>, <span>\\(x\\mapsto x^{2^m+1}+x^{2^i+1}\\)</span> has maximal number of bent components if and only if <span>\\(i=0\\)</span>.</p>","PeriodicalId":11130,"journal":{"name":"Designs, Codes and Cryptography","volume":"63 1","pages":""},"PeriodicalIF":1.4000,"publicationDate":"2025-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Designs, Codes and Cryptography","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s10623-025-01569-0","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
Abstract
We study vectorial functions with maximal number of bent components in this paper. We first study the Walsh transform and nonlinearity of \(F(x)=x^{2^e}h(\textrm{Tr}_{2^{2m}/2^m}(x))\), where \(e\ge 0\) and h(x) is a permutation over \({\mathbb {F}}_{2^m}\). If h(x) is monomial, the nonlinearity of F(x) is shown to be at most \( 2^{2\,m-1}-2^{\lfloor \frac{3\,m}{2}\rfloor }\) and some non-plateaued and plateaued functions attaining the upper bound are found. If h(x) is linear, the exact nonlinearity of F(x) is determined. Secondly, we give a construction of vectorial functions with maximal number of bent components from known ones, thus obtain two new classes from the Niho class and the Maiorana-McFarland class. Our construction gives a quadratic vectorial function that is not equivalent to the known functions of the form xh(x), and also contains vectorial functions outside the completed Maiorana-McFarland class. Finally, we show that the vectorial function \(F: {\mathbb {F}}_{2^{2m}}\rightarrow {\mathbb {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\).
期刊介绍:
Designs, Codes and Cryptography is an archival peer-reviewed technical journal publishing original research papers in the designated areas. There is a great deal of activity in design theory, coding theory and cryptography, including a substantial amount of research which brings together more than one of the subjects. While many journals exist for each of the individual areas, few encourage the interaction of the disciplines.
The journal was founded to meet the needs of mathematicians, engineers and computer scientists working in these areas, whose interests extend beyond the bounds of any one of the individual disciplines. The journal provides a forum for high quality research in its three areas, with papers touching more than one of the areas especially welcome.
The journal also considers high quality submissions in the closely related areas of finite fields and finite geometries, which provide important tools for both the construction and the actual application of designs, codes and cryptographic systems. In particular, it includes (mostly theoretical) papers on computational aspects of finite fields. It also considers topics in sequence design, which frequently admit equivalent formulations in the journal’s main areas.
Designs, Codes and Cryptography is mathematically oriented, emphasizing the algebraic and geometric aspects of the areas it covers. The journal considers high quality papers of both a theoretical and a practical nature, provided they contain a substantial amount of mathematics.