In this paper, we classify quadratic and cubic self-dual bent functions in eight variables with the help of computers. There are exactly four and 45 non-equivalent self-dual bent functions of degree two and three, respectively. This result is achieved by enumerating all eigenvectors with ± 1 entries of the Sylvester Hadamard matrix with an integer programming algorithm based on lattice basis reduction. The search space has been reduced by breaking the symmetry of the problem with the help of additional constraints. The final number of non-isomorphic self-dual bent functions has been determined by exploiting that EA-equivalence of Boolean functions is related to the equivalence of linear codes.
Bosma W., Cannon J.: Handbook of Magma Functions. Sydney (1995).
Carlet C.: Boolean functions for cryptography and error correcting code. In: Crama, Y., Hammer, P.L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 257–397. Cambridge University Press, Cambridge (2010)
Carlet C.: Vectorial Boolean functions for cryptography. In: Crama, Y., Hammer, P.L. (eds.) Boolean Models and Methods in Mathematics, Computer Science, and Engineering, pp. 398–469. Cambridge University Press, Cambridge (2010)
Carlet C., Danielsen L.E., Parker M.G., Solé P.: Self-dual bent functions. Int. J. Inf. Coding Theory. 1(4), 384–399 (2010)
Danielsen L.E., Parker M.G., Solé P.: The Rayleigh quotient of bent functions, Springer Lect. Notes in Comp. Sci. 5921, pp. 418–432. Springer, Berlin (2009).
Dillon J.F.: Elementary Hadamard difference sets. Ph.D. Thesis, University of Maryland, College Park (1972).
Feulner T.: The Automorphism Groups of Linear Codes and Canonical Representatives of Their Semilinear Isometry Classes. Adv. Math. Commun. 3, 363–383 (2009)
Feulner T.: APN functions. http://www.algorithm.uni-bayreuth.de/en/research/Coding_Theory/APN_Functions/index.html.
Hou X.-D.: Cubic bent functions. Discr. Math. 189(1–3), 149–161 (1998)
Hou X.-D.: Classification of self-dual quadratic bent functions. Des. Codes Cryptogr. 63(2), 183–198 (2012)
Hyun J.Y., Lee H., Lee Y.: MacWilliams duality and Gleason-type theorem on self-dual bent functions. Des. Codes Cryptogr. 63(3), 295–304 (2012)
Janusz G.J.: Parametrization of self-dual codes by orthogonal matrices. Finite Fields Appl. 52(2), 738–743 (2007)
Langevin Ph., Leander G.: Counting all bent functions in dimension eight 99270589265934370 305785861242880. Des. Codes Cryptogr. 59(1–3), 193–205 (2011)
MacWilliams F.J., Sloane N.J.: Theory of error correcting codes. North-Holland, Amsterdam (1998)
Rothaus O.S.: On bent functions. J. Combinatorial Theory Ser. A 20(3), 300–305 (1976)
Wassermann A.: Attacking the market split problem with lattice point enumeration. J. Combinatorial Optim. 6, 5–16 (2002)
This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Finite Geometries”
About this article
Cite this article
Feulner, T., Sok, L., Solé, P. et al. Towards the classification of self-dual bent functions in eight variables. Des. Codes Cryptogr. 68, 395–406 (2013). https://doi.org/10.1007/s10623-012-9740-0
- Boolean functions
- Bent functions
- Integer programming
Mathematics Subject Classification (2000)