{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:32:20Z","timestamp":1780054340057,"version":"3.54.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:00:00Z","timestamp":1676419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T00:00:00Z","timestamp":1676419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100012320","name":"Otto-von-Guericke-Universit\u00e4t Magdeburg","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100012320","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2024,3]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Recently, several interesting constructions of vectorial Boolean functions with the maximum number of bent components (MNBC functions, for short) were proposed. However, many of them have component functions from the completed Maiorana-McFarland class <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathcal {M}}^{\\#}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>M<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mo>#<\/mml:mo>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>. Moreover, no examples of MNBC functions containing component functions provably outside <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathcal {M}}^{\\#}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>M<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mo>#<\/mml:mo>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> are known. In this paper, we classify all MNBC functions in six variables. Based on the analysis of the obtained equivalence classes, we propose several infinite families of MNBC functions with component functions outside the <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\mathcal {M}}^{\\#}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mrow>\n                      <mml:mi>M<\/mml:mi>\n                    <\/mml:mrow>\n                    <mml:mo>#<\/mml:mo>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> class. In particular, two of our new constructions are solutions to the open problem\u00a0[Bapi\u0107 et al (eds) Proceedings of the twelfth international workshop on coding and cryptography, 2022, Item 1., p. 9].<\/jats:p>","DOI":"10.1007\/s10623-022-01180-7","type":"journal-article","created":{"date-parts":[[2023,2,17]],"date-time":"2023-02-17T07:08:54Z","timestamp":1676617734000},"page":"531-552","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Vectorial Boolean functions with the maximum number of bent components beyond the Nyberg\u2019s bound"],"prefix":"10.1007","volume":"92","author":[{"given":"Amar","family":"Bapi\u0107","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Enes","family":"Pasalic","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0461-4793","authenticated-orcid":false,"given":"Alexandr","family":"Polujan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alexander","family":"Pott","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,2,15]]},"reference":[{"issue":"7","key":"1180_CR1","doi-asserted-by":"publisher","first-page":"4891","DOI":"10.1109\/TIT.2021.3079223","volume":"67","author":"N Anbar","year":"2021","unstructured":"Anbar N., Kalayc\u0131 T., Meidl W.: Analysis of $$(n, n)$$-functions obtained from the Maiorana-McFarland class. IEEE Trans. Inf. Theory 67(7), 4891\u20134901 (2021). https:\/\/doi.org\/10.1109\/TIT.2021.3079223.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"1180_CR2","doi-asserted-by":"publisher","first-page":"2463","DOI":"10.1007\/s10623-021-00930-3","volume":"89","author":"A Bapi\u0107","year":"2021","unstructured":"Bapi\u0107 A., Pasalic E.: A new method for secondary constructions of vectorial bent functions. Des. Codes Cryptogr. 89(11), 2463\u20132475 (2021). https:\/\/doi.org\/10.1007\/s10623-021-00930-3.","journal-title":"Des. Codes Cryptogr."},{"key":"1180_CR3","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/j.dam.2022.02.010","volume":"314","author":"A Bapi\u0107","year":"2022","unstructured":"Bapi\u0107 A., Pasalic E.: Constructions of (vectorial) bent functions outside the completed Maiorana-McFarland class. Discret. Appl. Math. 314, 197\u2013212 (2022). https:\/\/doi.org\/10.1016\/j.dam.2022.02.010.","journal-title":"Discret. Appl. Math."},{"key":"1180_CR4","doi-asserted-by":"crossref","unstructured":"Bapi\u0107 A., Pasalic E., Polujan A., Pott A.: Vectorial Boolean functions with the maximum number of bent components outside the $${\\cal{M}}^\\#$$ class. In: Proceedings of the twelfth international workshop on coding and cryptography (2022). https:\/\/www.wcc2022.uni-rostock.de\/storages\/uni-rostock\/Tagungen\/WCC2022\/Papers\/WCC_2022_paper_9.pdf","DOI":"10.1007\/s10623-022-01180-7"},{"key":"1180_CR5","doi-asserted-by":"publisher","unstructured":"Bosma W., Cannon J., Playoust C.: The Magma algebra system. I. The user language. J. Symb. Comput. 24(3\u20134), 235\u2013265 (1997). https:\/\/doi.org\/10.1006\/jsco.1996.0125. Computational algebra and number theory (London, 1993)","DOI":"10.1006\/jsco.1996.0125"},{"key":"1180_CR6","unstructured":"Budaghyan L., Carlet C.: On CCZ-equivalence and its use in secondary constructions of bent functions. In: Preproceedings of the international workshop on coding and cryptography, WCC 2009, pp. 19\u201336. Ullensvang, Norway (2009). https:\/\/eprint.iacr.org\/2009\/042.pdf"},{"key":"1180_CR7","doi-asserted-by":"publisher","unstructured":"Carlet C.: Two new classes of bent functions. In: T. Helleseth (ed.) Advances in Cryptology\u2014EUROCRYPT \u201993. Lecture Notes in Computer Science, vol. 765, pp. 77\u2013101. Springer, Berlin, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-48285-7_8","DOI":"10.1007\/3-540-48285-7_8"},{"key":"1180_CR8","doi-asserted-by":"publisher","unstructured":"Dillon J.F.: Elementary Hadamard difference sets. Ph.D. thesis, University of Maryland (1974). https:\/\/doi.org\/10.13016\/M2MS3K194","DOI":"10.13016\/M2MS3K194"},{"key":"1180_CR9","unstructured":"Edel Y., Pott A.: On the equivalence of nonlinear functions. In: Enhancing cryptographic primitives with techniques from error correcting codes, pp. 87\u2013103 (2009). http:\/\/hdl.handle.net\/1854\/LU-710528"},{"key":"1180_CR10","doi-asserted-by":"publisher","unstructured":"Effinger G., Mullen G.: Elementary number theory (2021). https:\/\/doi.org\/10.1201\/9781003193111.","DOI":"10.1201\/9781003193111"},{"key":"1180_CR11","doi-asserted-by":"publisher","unstructured":"Kudin, S., Pasalic, E.: A complete characterization of $$ {\\cal{D}}_0 \\cap {\\cal{M}}^\\#$$ and a general framework for specifying bent functions in $${\\cal{C}}$$ outside $${\\cal{M}}^\\#$$. Des. Codes Cryptogr. 90, 1783\u20131796 (2022). https:\/\/doi.org\/10.1007\/s10623-022-01079-3","DOI":"10.1007\/s10623-022-01079-3"},{"key":"1180_CR12","doi-asserted-by":"publisher","unstructured":"Kyureghyan G.M., Pott A.: Some theorems on planar mappings. In: J.\u00a0von\u00a0zur Gathen, J.L. Ima\u00f1a, \u00c7.K. Ko\u00e7 (eds.) Arithmetic of finite fields, pp. 117\u2013122. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-69499-1_10","DOI":"10.1007\/978-3-540-69499-1_10"},{"key":"1180_CR13","doi-asserted-by":"publisher","first-page":"271","DOI":"10.3233\/FI-2016-1386","volume":"146","author":"B Mandal","year":"2016","unstructured":"Mandal B., St\u0103nic\u0103 P., Gangopadhyay S., Pasalic E.: An analysis of the $${\\cal{C} }$$ class of bent functions. Fundam. Inform. 146, 271\u2013292 (2016). https:\/\/doi.org\/10.3233\/FI-2016-1386.","journal-title":"Fundam. Inform."},{"issue":"1","key":"1180_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2022.113157","volume":"346","author":"W Meidl","year":"2023","unstructured":"Meidl W., Polujan A.A., Pott A.: Linear codes and incidence structures of bent functions and their generalizations. Discret. Math. 346(1), 113157 (2023). https:\/\/doi.org\/10.1016\/j.disc.2022.113157.","journal-title":"Discret. Math."},{"key":"1180_CR15","doi-asserted-by":"publisher","first-page":"2597","DOI":"10.1007\/s10623-019-00639-4","volume":"87","author":"S Mesnager","year":"2019","unstructured":"Mesnager S., Zhang F., Tang C., Zhou Y.: Further study on the maximum number of bent components of vectorial functions. Des. Codes Cryptogr. 87, 2597\u20132610 (2019). https:\/\/doi.org\/10.1007\/s10623-019-00639-4.","journal-title":"Des. Codes Cryptogr."},{"key":"1180_CR16","doi-asserted-by":"publisher","unstructured":"Nyberg K.: Perfect nonlinear S-Boxes. In: Advances in cryptology\u2014EUROCRYPT \u201991, workshop on the theory and application of of cryptographic techniques, Brighton, UK, April 8\u201311, 1991, Proceedings, Lecture Notes in Computer Science, vol. 547, pp. 378\u2013386. Springer (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_32","DOI":"10.1007\/3-540-46416-6_32"},{"key":"1180_CR17","unstructured":"Pasalic E., Bapi\u0107 A., Zhang F., Wei Y.: Explicit infinite families of bent functions outside $${\\cal{M}}^\\#$$. Des. Codes Cryptogr."},{"key":"1180_CR18","unstructured":"Polujan A., Pott A.: Towards the classification of quadratic vectorial bent functions in 8 variables. In: The 7th international workshop on Boolean functions and their applications (2022)"},{"key":"1180_CR19","doi-asserted-by":"publisher","unstructured":"Polujan A.A.: Boolean and vectorial functions: A design-theoretic point of view. Ph.D. thesis, Otto-von-Guericke-Universit\u00e4t Magdeburg (2021). https:\/\/doi.org\/10.25673\/37956","DOI":"10.25673\/37956"},{"issue":"9","key":"1180_CR20","doi-asserted-by":"publisher","first-page":"1701","DOI":"10.1007\/s10623-019-00712-y","volume":"88","author":"AA Polujan","year":"2020","unstructured":"Polujan A.A., Pott A.: Cubic bent functions outside the completed Maiorana-McFarland class. Des. Codes Cryptogr. 88(9), 1701\u20131722 (2020). https:\/\/doi.org\/10.1007\/s10623-019-00712-y.","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"1180_CR21","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1109\/TIT.2020.3040754","volume":"67","author":"AA Polujan","year":"2021","unstructured":"Polujan A.A., Pott A.: On design-theoretic aspects of Boolean and vectorial bent functions. IEEE Trans. Inf. Theory 67(2), 1027\u20131037 (2021). https:\/\/doi.org\/10.1109\/TIT.2020.3040754.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"1180_CR22","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1109\/TIT.2017.2749421","volume":"64","author":"A Pott","year":"2018","unstructured":"Pott A., Pasalic E., Muratovi\u0107-Ribi\u0107 A., Bajri\u0107 S.: On the maximum number of bent components of vectorial functions. IEEE Trans. Inf. Theory 64(1), 403\u2013411 (2018). https:\/\/doi.org\/10.1109\/TIT.2017.2749421.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"1180_CR23","doi-asserted-by":"publisher","first-page":"6149","DOI":"10.1109\/TIT.2017.2717966","volume":"63","author":"C Tang","year":"2017","unstructured":"Tang C., Zhou Z., Qi Y., Zhang X., Fan C., Helleseth T.: Generic construction of bent functions and bent idempotents with any possible algebraic degrees. IEEE Trans. Inf. Theory 63(10), 6149\u20136157 (2017). https:\/\/doi.org\/10.1109\/TIT.2017.2717966.","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1180_CR24","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.ffa.2007.03.001","volume":"13","author":"G Weng","year":"2007","unstructured":"Weng G., Feng R., Qiu W.: On the ranks of bent functions. Finite Fields Their Appl. 13(4), 1096\u20131116 (2007). https:\/\/doi.org\/10.1016\/j.ffa.2007.03.001.","journal-title":"Finite Fields Their Appl."},{"key":"1180_CR25","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1016\/j.dam.2020.06.012","volume":"285","author":"F Zhang","year":"2020","unstructured":"Zhang F., Cepak N., Pasalic E., Wei Y.: Further analysis of bent functions from $${\\cal{C} }$$ and $${\\cal{D} }$$ which are provably outside or inside $${\\cal{M} }^\\#$$. Discret. Appl. Math. 285, 458\u2013472 (2020). https:\/\/doi.org\/10.1016\/j.dam.2020.06.012.","journal-title":"Discret. Appl. Math."},{"issue":"8","key":"1180_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2021.112473","volume":"344","author":"L Zheng","year":"2021","unstructured":"Zheng L., Kan H., Peng J., Tang D.: Constructing vectorial bent functions via second-order derivatives. Discret. Math. 344(8), 112473 (2021). https:\/\/doi.org\/10.1016\/j.disc.2021.112473.","journal-title":"Discret. Math."},{"key":"1180_CR27","doi-asserted-by":"publisher","first-page":"2171","DOI":"10.1007\/s10623-020-00770-7","volume":"88","author":"L Zheng","year":"2020","unstructured":"Zheng L., Peng J., Kan H., Jun L., Luo J.: On constructions and properties of $$(n, m)$$-functions with maximal number of bent components. Des. Codes Cryptogr. 88, 2171\u20132186 (2020). https:\/\/doi.org\/10.1007\/s10623-020-00770-7.","journal-title":"Des. Codes Cryptogr."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01180-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-022-01180-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-022-01180-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,29]],"date-time":"2024-03-29T15:11:48Z","timestamp":1711725108000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-022-01180-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,15]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1180"],"URL":"https:\/\/doi.org\/10.1007\/s10623-022-01180-7","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,2,15]]},"assertion":[{"value":"12 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 December 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2023","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}