Bent functions from triples of permutation polynomials
Daniele Bartoli, Maria Montanucci, Giovanni Zini

TL;DR
This paper introduces new methods for constructing bent functions by utilizing triples of permutations, expanding beyond involutions to include various polynomial types.
Contribution
It presents novel constructions of bent functions using triples of permutations, including monomials, binomials, trinomials, and quadrinomials, broadening the existing framework.
Findings
New permutation-based bent function constructions
Inclusion of diverse polynomial types beyond involutions
Enhanced methods for bent function generation
Abstract
We provide constructions of bent functions using triples of permutations. This approach is due to Mesnager. In general, involutions have been mostly considered in such a machinery; we provide some other suitable triples of permutations, using monomials, binomials, trinomials, and quadrinomials.
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 · Advanced Combinatorial Mathematics
