Several new classes of self-dual bent functions derived from involutions
- 8 Downloads
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.
KeywordsInvolution Bent function Permutation polynomial
Mathematics Subject Classification (2014)97N70
The authors thank the Associate Editor and the anonymous reviewers for their valuable comments which have highly improved then manuscript.
- 2.Carlet, C.: Boolean functions for cryptography and error correcting codes. In: Crama, Y., Hammer, P. L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp 257–397. Cambridge Univ. Press, Cambridge (2010)Google Scholar
- 3.Carlet, C.: Two New Classes of Bent Functions. Advances in Cryptology EUROCRYPT, 93, 77–101, Lecture Notes in Comput Sci., vol. 765. Springer, Berlin (1994)Google Scholar
- 4.Carlet, C., Mesnager, S.: Four Decades of Research on Bent Functions. Journal Designs, Codes and Cryptography (2016)Google Scholar
- 9.Dillon, J.: Elementary Hadamard Difference Sets, Ph.D. Dissertation, Netw. Commun. Lab., Univ., Maryland (1974)Google Scholar
- 17.Mesnager, S., Cohen, G., Madore, D.: On existence (based on an arithmetical problem) and constructions of bent functions. In: Proceedings of 15th International Conference on Cryptograph. Coding, pp. 3–19 (2015)Google Scholar
- 18.Mesnager, S.: On constructions of bent functions from involutions. In: Proceedings of ISIT, pp. 110–114 (2016)Google Scholar
- 20.Mesnager, S., Ongan, P., Ozbudak, F.: New bent functions from permutations and linear translators, c2SI 2017: Codes, Cryptology and Information Security, pp. 282–297 (2017)Google Scholar