{"title":"On a Lower Bound for the Number of Bent Functions at the Minimum Distance from a Bent Function in the Maiorana–McFarland Class","authors":"D. A. Bykov, N. A. Kolomeec","doi":"10.1134/S1990478923030055","DOIUrl":null,"url":null,"abstract":"<p> Bent functions at the minimum distance\n<span>\\( 2^n \\)</span> from a given bent function of\n<span>\\( 2n \\)</span> variables belonging to the Maiorana–McFarland class\n<span>\\( \\mathcal {M}_{2n} \\)</span> are investigated. We provide a criterion for a function obtained using the\naddition of the indicator of an\n<span>\\( n \\)</span>-dimensional affine subspace to a given bent function from\n<span>\\( \\mathcal {M}_{2n} \\)</span> to be a bent function as well. In other words, all bent functions at the\nminimum distance from a Maiorana–McFarland bent function are characterized. It is shown that\nthe lower bound\n<span>\\( 2^{2n+1}-2^n \\)</span> for the number of bent functions at the minimum distance from\n<span>\\( f \\in \\mathcal {M}_{2n} \\)</span> is not attained if the permutation used for constructing\n<span>\\( f \\)</span> is not an APN function. It is proved that for any prime\n<span>\\( n\\geq 5 \\)</span> there exist functions in\n<span>\\( \\mathcal {M}_{2n} \\)</span> for which this lower bound is accurate. Examples of such bent functions are\nfound. It is also established that the permutations of EA-equivalent functions in\n<span>\\( \\mathcal {M}_{2n} \\)</span> are affinely equivalent if the second derivatives of at least one of the\npermutations are not identically zero.\n</p>","PeriodicalId":607,"journal":{"name":"Journal of Applied and Industrial Mathematics","volume":"17 3","pages":"507 - 520"},"PeriodicalIF":0.5800,"publicationDate":"2023-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Applied and Industrial Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://link.springer.com/article/10.1134/S1990478923030055","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0
Abstract
Bent functions at the minimum distance
\( 2^n \) from a given bent function of
\( 2n \) variables belonging to the Maiorana–McFarland class
\( \mathcal {M}_{2n} \) are investigated. We provide a criterion for a function obtained using the
addition of the indicator of an
\( n \)-dimensional affine subspace to a given bent function from
\( \mathcal {M}_{2n} \) to be a bent function as well. In other words, all bent functions at the
minimum distance from a Maiorana–McFarland bent function are characterized. It is shown that
the lower bound
\( 2^{2n+1}-2^n \) for the number of bent functions at the minimum distance from
\( f \in \mathcal {M}_{2n} \) is not attained if the permutation used for constructing
\( f \) is not an APN function. It is proved that for any prime
\( n\geq 5 \) there exist functions in
\( \mathcal {M}_{2n} \) for which this lower bound is accurate. Examples of such bent functions are
found. It is also established that the permutations of EA-equivalent functions in
\( \mathcal {M}_{2n} \) are affinely equivalent if the second derivatives of at least one of the
permutations are not identically zero.
期刊介绍:
Journal of Applied and Industrial Mathematics is a journal that publishes original and review articles containing theoretical results and those of interest for applications in various branches of industry. The journal topics include the qualitative theory of differential equations in application to mechanics, physics, chemistry, biology, technical and natural processes; mathematical modeling in mechanics, physics, engineering, chemistry, biology, ecology, medicine, etc.; control theory; discrete optimization; discrete structures and extremum problems; combinatorics; control and reliability of discrete circuits; mathematical programming; mathematical models and methods for making optimal decisions; models of theory of scheduling, location and replacement of equipment; modeling the control processes; development and analysis of algorithms; synthesis and complexity of control systems; automata theory; graph theory; game theory and its applications; coding theory; scheduling theory; and theory of circuits.