Bent functions from triples of permutation polynomials

2019/01/06 by Daniele Bartoli, Bartoli, Daniele, Maria Montanucci +3
Computer Science · Engineering · Mathematics · #Coding theory and cryptography #graph theory and CDMA systems #Advanced Combinatorial Mathematics

paper · pdf · doi:10.48550/arxiv.1901.02359

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.

Related

• Generalized Permutations and Ternary Bent Functions
• Constructing bent functions and bent idempotents of any possible algebraic degrees
• Bent functions satisfying the dual bent condition and permutations with the (A_m) property
• (Not) weakly regular univariate bent functions
• Permutations satisfying (P₁) and (P₂) properties and ℓ-optimal bent functions