On Generalized Bent Functions - ITA @ UCSD.pdfVIP

On Generalized Bent Functions Tor Helleseth and Alexander Kholosha The Selmer Center Department of Informatics, University of Bergen, P.O. Box 7800 N-5020 Bergen, Norway Email: {Tor.Helleseth, Alexander.Kholosha}@ii.uib.no Abstract—Bent functions were first introduced by Rothaus in Walsh transform coefficients via the relation ∑ 1976 as an interesting combinatorial object with the important property of having the maximum distance to all affine func- − −· tions. Bent functions have many applications to coding theory, ∈ cryptography and sequence designs. For many years the focus was on the construction of binary bent functions. There are Some useful properties involving the Walsh transform co- several known examples of binary monomial and binomial bent efficients are functions. In 1985, Kumar, Scholtz and Welch generalized bent ∑ ∑ ∑ ∑− · functions to the case of an arbitrary finite field. In the recent years, new results on nonbinary bent functions have appeared. ∈ This paper gives an updated overview of some of the recent ∑ ∑− ∑−· results and open problems on generalized bent functions. This includes some recent constructions of weakly regular monomial and binomial bent functions and examples of non-weakly regular ∑− bent functions. I. INTRODUCTION