Several new classes of self-dual bent functions derived from involutions

  • Gaojun LuoEmail author
  • Xiwang Cao
  • Sihem Mesnager
Part of the following topical collections:
  1. Special Issue on Boolean Functions and Their Applications


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.


Involution Bent function Permutation polynomial 

Mathematics Subject Classification (2014)




The authors thank the Associate Editor and the anonymous reviewers for their valuable comments which have highly improved then manuscript.


  1. 1.
    Carlet, C.: On bent and highly nonlinear balanced/resilient functions and their algebraic immunities, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pp 1–28. Springer, Berlin (2006)zbMATHGoogle Scholar
  2. 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. 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. 4.
    Carlet, C., Mesnager, S.: Four Decades of Research on Bent Functions. Journal Designs, Codes and Cryptography (2016)Google Scholar
  5. 5.
    Çesmelioğlu, A., Meidl, W., Pott, A.: Vectorial bent functions and their duals. Linear Algebra Appl. 548, 305–320 (2018)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Charpin, P., Mesnager, S., Sarkar, S.: Involutions over the Galois field \({F}_{2^{n}}\). IEEE Trans. Inf. Theory 62(4), 2266–2276 (2016)CrossRefzbMATHGoogle Scholar
  7. 7.
    Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering codes. Amsterdam, The Netherlands (1997)zbMATHGoogle Scholar
  8. 8.
    Coulter, R., Mesnager, S.: Bent Functions From Involutions Over \({F}_{2^{n}}\). IEEE Trans. Inf. Theory 64(4), 2979–2986 (2018)CrossRefzbMATHGoogle Scholar
  9. 9.
    Dillon, J.: Elementary Hadamard Difference Sets, Ph.D. Dissertation, Netw. Commun. Lab., Univ., Maryland (1974)Google Scholar
  10. 10.
    Ding, C.: A construction of binary linear codes from Boolean functions. Discret. Math. 339, 2288–2303 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  11. 11.
    Kolomeec, N.: The graph of minimal distances of bent functions and its properties. Des. Codes Cryptogr. 85, 395–410 (2017)MathSciNetCrossRefzbMATHGoogle Scholar
  12. 12.
    Kolomeec, N.: Enumeration of the bent functions of least deviation from a quadratic bent function. J. Appl. Ind. Math. 6(3), 306–317 (2012)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Kyureghyan, G.: Constructing permutations of finite fields via linear translators. J. Comb. Theory, Ser. A 118, 1052–1061 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Lidl, R., Niederreiter, H.: Finite fields. University Press, Cambridge (1997)zbMATHGoogle Scholar
  15. 15.
    Mesnager, S.: Several new infinite families of bent functions and their duals. IEEE Trans. Inf. Theory 60(7), 4397–4407 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Mesnager, S.: Further constructions of infinite families of bent functions from new permutations and their duals. Crypt. Commun. 8(2), 229–246 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 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. 18.
    Mesnager, S.: On constructions of bent functions from involutions. In: Proceedings of ISIT, pp. 110–114 (2016)Google Scholar
  19. 19.
    Mesnager, S.: Bent Functions: Fundamentals and Results. Springer, Switzerland (2016)CrossRefzbMATHGoogle Scholar
  20. 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
  21. 21.
    Rothaus, O.: On ‘bent’ functions. J. Combinat. Theory, Ser. A 20(3), 300–305 (1976)CrossRefzbMATHGoogle Scholar
  22. 22.
    Olsen, J., Scholtz, R., Welch, L.: Bent-function sequences. IEEE Trans. Inf. Theory 28(6), 858–864 (1982)MathSciNetCrossRefzbMATHGoogle Scholar
  23. 23.
    Pott, A., Tan, Y., Feng, T.: Strongly regular graphs associated with ternary bent functions. J. Combinat. Theory, Ser. A 117(6), 668–682 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Xiang, C., Ding, C., Mesnager, S.: Optimal codebooks from binary codes meeting the Levenshtein bound. IEEE Trans. Inf. Theory 61(12), 6526–6535 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Zhou, Z., Ding, C., Li, N.: New families of codebooks achieving the Levenshtein bound. IEEE Trans. Inf. Theory 60(11), 7382–7387 (2014)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of MathNanjing University of Aeronautics and AstronauticsNanjingChina
  2. 2.State Key Laboratory of Information SecurityInstitute of Information Engineering, Chinese Academy of SciencesBeijingChina
  3. 3.Department of MathematicsUniversity of Paris VIIISaint-DenisFrance
  4. 4.University of Paris XIII, CNRS, LAGA UMR 7539, Sorbonne Paris CitéVilletaneuseFrance
  5. 5.Telecom ParisTechParisFrance

Personalised recommendations