On functions with the maximal number of bent components
Nurdag\"ul Anbar, Tekg\"ul Kalayc{\i}, Wilfried Meidl, L\'aszl\'o, M\'erai

TL;DR
This paper investigates functions with the maximum number of bent components, establishing bounds on their nonlinearity, analyzing specific classes of such functions, and identifying conditions under which they achieve maximal nonlinearity.
Contribution
It provides new bounds on nonlinearity for plateaued functions with maximal bent components and characterizes functions achieving these bounds, especially for even m.
Findings
Bound on nonlinearity for plateaued functions with maximal bent components.
Only specific functions attain maximal nonlinearity when m is odd.
Multiple nontrivial EA-equivalence classes with maximal bent components exist for even m.
Abstract
A function , , can have at most bent component functions. Trivial examples are obtained as , where is a vectorial bent function from to , and , , are affine Boolean functions. A class of nontrivial examples is given in univariate form with the functions , where is a linearized permutation of . In the first part of this article it is shown that plateaued functions with bent components can have nonlinearity at most , a bound which is attained by the example , (Pott et al. 2018). This partially solves Question 5 in Pott et al. 2018. We then…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCoding theory and cryptography · graph theory and CDMA systems · semigroups and automata theory
