Bent Functions in \(\mathcal C\) and \(\mathcal D\) Outside the Completed Maiorana-McFarland Class

  • F. Zhang
  • E. PasalicEmail author
  • N. Cepak
  • Y. Wei
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10194)


Two new classes of bent functions derived from the Maiorana-McFarland (\(\mathcal {M}\)) class, so-called \({\mathcal {C}}\) and \( {\mathcal {D}}\), were introduced by Carlet [2] two decades ago. However, apart from the subclass \({\mathcal {D}}_0\), some explicit construction methods for these functions were not provided in [2]. Assuming the possibility of specifying a bent function f that belongs to one of these two classes (apart from \({\mathcal {D}}_0\)), the most important issue is then to determine whether f is still contained in the known primary classes or lies outside their completed versions. In this article we partially solve this question by providing sufficient conditions on the permutation and related characteristic function (used to define f in these classes) so that f is provably outside the completed \(\mathcal {M}\) class. To give some existence results, we employ recent results in [12] where some instances of bent functions in \({\mathcal {C}}\) were identified by providing specific permutations and related characteristic functions. More precisely, using our sufficient conditions that apply to both \({\mathcal {C}}\) and \({\mathcal {D}}\), it is shown that these identified classes of \({\mathcal {C}}\) functions described in [12] do not belong to the completed \(\mathcal {M}\) class, whereas the question (which is more difficult) whether these functions are also outside the completed partial spread class remains open. We also propose some generic methods for specifying bent functions in \({\mathcal {D}}\) outside the completed Maiorana-McFarland class.


Bent functions \({\mathcal {C}}\) and \({\mathcal {D}}\) class Maiorana-McFarland class 



Fengrong Zhang is supported in part by National Science Foundation of China (Grant No. 61303263), and in part by the Fundamental Research Funds for the Central Universities (Grant No. 2015XKMS086), and in part by the China Postdoctoral Science Foundation funded project (Grant No. 2015T80600). Enes Pasalic is partly supported by the Slovenian Research Agency (research program P3- 0384 and research project J1-6720). Yongzhuang Wei is supported in part by the Natural Science Foundation of China (61572148), in part by the Guangxi Natural Science Found (2015GXNSFGA139007), in part by the project of Outstanding Young Teachers Training in Higher Education Institutions of Guangxi. Nastja Cepak is supported in part by the Slovenian Research Agency (research 25 program P3-0384 and Young Researchers Grant).


  1. 1.
    Blokhuis, A., Coulter, R.S., Henderson, M., O’Keefe, C.M.: Permutations amongst the Dembowski-Ostrom polynomials. In: Jungnickel, D., Niederreiter, H. (eds.) Proceedings of the Fifth International Conference on Finite Fields and Applications \(F_{q5}\), pp. 37–42. Springer, Berlin (2001)Google Scholar
  2. 2.
    Carlet, C.: Two new classes of bent functions. In: Helleseth, T. (ed.) EUROCRYPT 1993. LNCS, vol. 765, pp. 77–101. Springer, Heidelberg (1994). doi: 10.1007/3-540-48285-7_8 CrossRefGoogle Scholar
  3. 3.
    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 University Press, Cambridge (2010). Chapter of the monograph. CrossRefGoogle Scholar
  4. 4.
    Carlet, C.: Vectorial Boolean functions for cryptography. In: Crama, Y., Hammer, P. (eds.) Boolean Methods and Models, pp. 398–469. Cambridge University Press, Cambridge (2010). Google Scholar
  5. 5.
    Carlet, C., Mesnager, S.: Four decades of research on bent functions. Des. Codes Crypt. 78(1), 5–50 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Charpin, P., Sarkar, S.: Polynomials with linear structure and Maiorana-McFarland construction. IEEE Trans. Inform. Theory, IT 57(6), 3796–3804 (2011)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Cusick, T.W., Stănică, P.: Cryptographic Boolean Functions and Applications. Elsevier-Academic Press, Cambridge (2009)zbMATHGoogle Scholar
  8. 8.
    Dillon, J.F.: Elementary hadamard difference sets. In: Proceedings of 6th S.E. Conference of Combinatorics, Graph Theory, and Computing, Utility Mathematics, Winnipeg, pp. 237–249 (1975)Google Scholar
  9. 9.
    Dobbertin, H.: Construction of bent functions and balanced Boolean functions with high nonlinearity. In: Preneel, B. (ed.) FSE 1994. LNCS, vol. 1008, pp. 61–74. Springer, Heidelberg (1995). doi: 10.1007/3-540-60590-8_5 CrossRefGoogle Scholar
  10. 10.
    Laigle-Chapuy, Y.: A note on a class of quadratic permutations over \({\mathbb{F}}_{{2^n}}\). In: Boztaş, S., Lu, H.-F.F. (eds.) AAECC 2007. LNCS, vol. 4851, pp. 130–137. Springer, Heidelberg (2007). doi: 10.1007/978-3-540-77224-8_17 CrossRefGoogle Scholar
  11. 11.
    McFarland, R.L.: A family of noncyclic difference sets. J. Comb. Theory Ser. A 15, 1–10 (1973)CrossRefzbMATHGoogle Scholar
  12. 12.
    Mandal, B., Stanica, P., Gangopadhyay, S., Pasalic, E.: An analysis of \(\cal{C}\) class of bent functions. Fundamenta Informaticae 147(3), 271–292 (2016)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Rothaus, O.S.: On bent functions. J. Comb. Theory Ser. A 20, 300–305 (1976)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.School of Computer Science and TechnologyChina University of Mining and TechnologyXuzhouPeople’s Republic of China
  2. 2.FAMNIT and IAMUniversity of PrimorskaKoperSlovenia
  3. 3.FAMNITUniversity of PrimorskaKoperSlovenia
  4. 4.Guilin University of Electronic TechnologyGuilinPeople’s Republic of China

Personalised recommendations