Several types of functions over finite fields have relevant applications in applied areas of
mathematics, such as cryptography and coding theory. Among them, planar functions, APN …

In this paper, we investigate properties of generalized bent Boolean functions and 2k-bent
(ie, negabent, octabent, hexadecabent, et al.) Boolean functions in a uniform framework …

A recursive construction of complete mappings over finite fields is provided in this work.
These permutation polynomials, characterized by the property that both f (x)∈ F q [x] and its …

We present necessary and sufficient conditions for a Boolean function to be a negabent
function for both an even and an odd number of variables, which demonstrates the …

Boolean bent functions which at the same time have a flat nega-Hadamard transform are
called bent-negabent functions. The known families of these functions mostly stem from the …

In this paper, we introduce generalized hyperbent functions from F 2 n to ℤ 2 k, and
investigate decompositions of generalized (hyper) bent functions. We show that generalized …

The problem of constructing bent-negabent functions that do not belong to the completed
Maiorana-McFarland class emerges implicitly through a series of construction methods …

Based on the Feistel and MISTY structures, this paper presents several new constructions of
complete permutation polynomials (CPPs) of the finite field F _ 2^ n^ 2 F 2 n 2 for a positive …

This paper contributes to increase our knowledge on generalized bent functions (including
generalized bent Boolean functions and generalized p-ary bent functions with odd prime p) …

We classify complete permutation monomials of degree qn− 1 q− 1+ 1 over the finite field
with qn elements in odd characteristic, for n+ 1 a prime and (n+ 1) 4< q. As a corollary, a …