Abstract
Dobbertin has embedded the problem of construction of bent functions in a recursive framework by using a generalization of bent functions called \({\mathbb{Z}}\) -bent functions. Following his ideas, we generalize the construction of partial spreads bent functions to partial spreads \({\mathbb{Z}}\) -bent functions of arbitrary level. Furthermore, we show how these partial spreads \({\mathbb{Z}}\) -bent functions give rise to a new construction of (classical) bent functions. Further, we construct a bent function on 8 variables which is inequivalent to all Maiorana–McFarland as well as PS ap type bents. It is also shown that all bent functions on 6 variables, up to equivalence, can be obtained by our construction.
Similar content being viewed by others
References
Canteaut A., Charpin P.: Decomposing bent functions. IEEE Trans. Inf. Theory 49(8), 2004–2019 (2003)
Carlet C.: Generalized partial spreads. IEEE Trans. Inf. Theory 41, 1482–1487 (1995)
Carlet C.: Boolean functions for cryptography and error correcting codes. Chapter of the monograph. In: Crama Y., Hammer P. (eds.) Boolean Models and Methods in Mathematics, Computer Science and Engineering, pp. 257–397. Cambridge Univ. Press (2010).
Carlet C., Guillot P.: A characterization of binary bent functions. J. Comb. Theory, Ser. A 76, 328–335 (1996)
Dillon J.F.: Elementary Hadamard difference sets. Proceedings of Sixth S.E. Conference of Combinatorics, Graph Theory, and Computing, pp. 237–249. Utility Mathematics, Winnipeg (1975).
Dobbertin H., Leander G.: Bent functions embedded into the recursive framework of \({\mathbb{Z}}\) -bent functions. Des. Codes Cryptogr. 49, 3–22 (2008)
Gangopadhyay S., Sharma D., Sarkar S., Maitra S.: On affine (non)equivalence of Boolean functions. Computing 85, 37–55 (2009)
Langevin P., Hou X.-D.: Counting Partial Spread Functions in Eight Variables. IEEE Trans. Inf. Theory 57(4), 2263–2269 (2011)
MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland, Amsterdam (1977)
Rothaus O.S.: On bent functions. J. Comb. Theory Ser. A 20, 300–305 (1976)
Author information
Authors and Affiliations
Corresponding author
Additional information
This is one of several papers published in Designs, Codes and Cryptography comprising the “Special Issue on Coding and Cryptography”.
Rights and permissions
About this article
Cite this article
Gangopadhyay, S., Joshi, A., Leander, G. et al. A new construction of bent functions based on \({\mathbb{Z}}\) -bent functions. Des. Codes Cryptogr. 66, 243–256 (2013). https://doi.org/10.1007/s10623-012-9687-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-012-9687-1