Several classes of bent functions over finite fields

by   Xi Xie, et al.

Let ๐”ฝ_p^n be the finite field with p^n elements and Tr(ยท) be the trace function from ๐”ฝ_p^n to ๐”ฝ_p, where p is a prime and n is an integer. Inspired by the works of Mesnager (IEEE Trans. Inf. Theory 60(7): 4397-4407, 2014) and Tang et al. (IEEE Trans. Inf. Theory 63(10): 6149-6157, 2017), we study a class of bent functions of the form f(x)=g(x)+F(Tr(u_1x),Tr(u_2x),โ‹ฏ,Tr(u_ฯ„x)), where g(x) is a function from ๐”ฝ_p^n to ๐”ฝ_p, ฯ„โ‰ฅ2 is an integer, F(x_1,โ‹ฏ,x_n) is a reduced polynomial in ๐”ฝ_p[x_1,โ‹ฏ,x_n] and u_iโˆˆ๐”ฝ^*_p^n for 1โ‰ค i โ‰คฯ„. As a consequence, we obtain a generic result on the Walsh transform of f(x) and characterize the bentness of f(x) when g(x) is bent for p=2 and p>2 respectively. Our results generalize some earlier works. In addition, we study the construction of bent functions f(x) when g(x) is not bent for the first time and present a class of bent functions from non-bent Gold functions.


page 1

page 2

page 3

page 4

โˆ™ 01/11/2023

A note on constructions of bent functions

Recently, Li et al. presented a generic construction of bent functions i...
โˆ™ 06/28/2022

An Algebraic Construction Technique for Codes over Hurwitz Integers

Let ฮฑ be a prime Hurwitz integer. Hฮฑ, which is the set of residual class...
โˆ™ 01/27/2021

Constructing new APN functions through relative trace functions

In 2020, Budaghyan, Helleseth and Kaleyski [IEEE TIT 66(11): 7081-7087, ...
โˆ™ 04/26/2018

Linear (2,p,p)-AONTs do Exist

A (t,s,v)-all-or-nothing transform (AONT) is a bijective mapping defined...
โˆ™ 07/22/2022

A new class of negabent functions

Negabent functions were introduced as a generalization of bent functions...
โˆ™ 07/19/2020

Using double Weil sums in finding the c-Boomerang Connectivity Table for monomial functions on finite fields

In this paper we characterize the c-Boomerang Connectivity Table (BCT), ...
โˆ™ 05/06/2019

Two constructions of asymptotically optimal codebooks via the trace functions

In this paper, we present two new constructions of complex codebooks wit...

Please sign up or login with your details

Forgot password? Click here to reset