LAUSR

Bent functions are a kind of Boolean functions which have the maximum Hamming distance to linear and affine functions, they have some interesting applications in combinatorics, coding theory, cryptography and sequences. However, generally speaking, how to find new bent functions is a hard work and is a hot research project during the past decades. A subclass of bent functions that has received attention since Dillon’s seminal thesis (1974) is the subclass of those Boolean functions that are equal to their dual (or Fourier transform in Dillon’s terminology): the so-called self dual bent functions. In this paper, we propose a construction of involutions from linear translators, and provide two methods for constructing new involutions by utilizing some given involutions. With the involutions presented in this paper, several new classes of self-dual bent functions are produced.