{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:33:30Z","timestamp":1772120010137,"version":"3.50.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,1]],"date-time":"2024-11-01T00:00:00Z","timestamp":1730419200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003443","name":"Ministry of Education and Science of the Russian Federation","doi-asserted-by":"crossref","award":["FWNF-2022-0017"],"award-info":[{"award-number":["FWNF-2022-0017"]}],"id":[{"id":"10.13039\/501100003443","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2024,11]]},"DOI":"10.1007\/s12095-024-00766-3","type":"journal-article","created":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T06:44:56Z","timestamp":1734072296000},"page":"1347-1356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Upper bounds on the numbers of binary plateaued and bent functions"],"prefix":"10.1007","volume":"16","author":[{"given":"V. N.","family":"Potapov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,13]]},"reference":[{"key":"766_CR1","doi-asserted-by":"crossref","unstructured":"Agievich, S.V.: On the continuation to bent functions and upper bounds on their number. Prikl. Diskr. Mat. Suppl. 13, 18\u201321 (2020) (in Russian)","DOI":"10.17223\/2226308X\/13\/4"},{"key":"766_CR2","doi-asserted-by":"crossref","unstructured":"Carlet, C.: Boolean Functions for Cryptography and Coding Theory. pp. 562. Cambridge University Press, (2020)","DOI":"10.1017\/9781108606806"},{"key":"766_CR3","unstructured":"Carlet, C., Klapper, A.: Upper bounds on the number of resilient functions and of bent functions. In: Proc. of the 23rd Symposium on Information Theory in the Benelux. Louvain-La-Neuve, Belgium (2002)"},{"issue":"1","key":"766_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10623-015-0145-8","volume":"78","author":"C Carlet","year":"2016","unstructured":"Carlet, C., Mesnager, S.: Four decades of research on bent functions. Des. Codes Cryptogr. 78(1), 5\u201350 (2016)","journal-title":"Des. Codes Cryptogr."},{"issue":"2","key":"766_CR5","doi-asserted-by":"publisher","first-page":"1408","DOI":"10.1109\/TIT.2023.3305149","volume":"70","author":"J Jeong","year":"2024","unstructured":"Jeong, J., Lee, Y.: Algorithms for constructing balanced plateaued functions with maximal algebraic degrees. IEEE Trans. Inf. Theory 70(2), 1408\u20131421 (2024)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"766_CR6","first-page":"1346","volume":"13","author":"AV Khalyavin","year":"2016","unstructured":"Khalyavin, A.V., Lobanov, M.S., Tarannikov, Yu.V.: On plateaued Boolean functions with the same spectrum support. Sib. Elektron. Mat. Izv. 13, 1346\u20131368 (2016)","journal-title":"Sib. Elektron. Mat. Izv."},{"key":"766_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-3628-2","volume-title":"Universal compression and retrieval","author":"R Krichevsky","year":"1994","unstructured":"Krichevsky, R.: Universal compression and retrieval. Kluwer Academic Publishers, Dordrecht (1994)"},{"issue":"1\u20133","key":"766_CR8","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10623-010-9455-z","volume":"59","author":"P Langevin","year":"2011","unstructured":"Langevin, P., Leander, G., Rabizzoni, P., Veron, P., Zanotti, J.-P.: Counting all bent functions in dimension eight 99270589265934370305785861242880. Des. Codes Cryptography 59(1\u20133), 193\u2013205 (2011)","journal-title":"Des. Codes Cryptography"},{"key":"766_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.dam.2024.06.040","volume":"358","author":"L Li","year":"2024","unstructured":"Li, L., Huang, X., Zhao, Q., Zheng, D.: Two classes of $$1$$-resilient semi-bent functions based on disjoint linear codes. Discret. Appl. Math. 358, 147\u2013157 (2024)","journal-title":"Discret. Appl. Math."},{"key":"766_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32595-8","volume-title":"Bent Functions: Fundamentals and Results","author":"S Mesnager","year":"2016","unstructured":"Mesnager, S.: Bent Functions: Fundamentals and Results. Springer International Publishing, Switzerland (2016)"},{"key":"766_CR11","doi-asserted-by":"crossref","unstructured":"Mesnager, S., \u00d6zbudak, F., Sinak, A., Cohen, G.: On $$q$$-ary plateaued functions over $$F_q$$ and their explicit characterizations. European J. Combin. 80, 71\u201381 (2019)","DOI":"10.1016\/j.ejc.2018.02.025"},{"key":"766_CR12","doi-asserted-by":"crossref","unstructured":"Potapov, V.N.: An upper bound on the number of bent functions. In: Proc. XVII International Symposium on Problems of Redundancy in Information and Control Systems. pp. 95\u201396. Moscow, Russia, IEEE (2021)","DOI":"10.1109\/REDUNDANCY52534.2021.9606445"},{"issue":"5","key":"766_CR13","doi-asserted-by":"publisher","first-page":"867","DOI":"10.1134\/S0037446620050109","volume":"61","author":"VN Potapov","year":"2020","unstructured":"Potapov, V.N., Avgustinovich, S.V.: Combinatorial designs, difference sets, and bent functions as perfect colorings of graphs and multigraphs. Siberian Math. J. 61(5), 867\u2013877 (2020)","journal-title":"Siberian Math. J."},{"key":"766_CR14","doi-asserted-by":"crossref","unstructured":"Potapov, V.N., Taranenko, A.A., Tarannikov, Yu.V.: Asymptotic bounds on numbers of bent functions and partitions of the Boolean hypercube into linear and affine subspaces. Des. Codes and Cryptogr. 92(3), 639\u2013651 (2024) Special Issue: Coding and Cryptography 2022","DOI":"10.1007\/s10623-023-01239-z"},{"key":"766_CR15","doi-asserted-by":"publisher","unstructured":"Potapov, V.N., \u00d6zbudak, F.: Asymptotic lower bounds on the number of bent functions having odd many variables over finite fields of odd characteristic. Cryptography and Communications, 2024, Boolean Functions and Their Applications VIII. (2024). https:\/\/doi.org\/10.1007\/s12095-024-00726-x","DOI":"10.1007\/s12095-024-00726-x"},{"key":"766_CR16","doi-asserted-by":"crossref","unstructured":"Potapov, V.N.: Existence of balanced functions that are not derivative of bent functions. In: Proc. 2023 XVIII International Symposium on Problems of Redundancy in Information and Control Systems. IEEE, Moscow, Russia (2023)","DOI":"10.1109\/Redundancy59964.2023.10330175"},{"issue":"4","key":"766_CR17","doi-asserted-by":"publisher","first-page":"609","DOI":"10.3934\/amc.2011.5.609","volume":"5","author":"NN Tokareva","year":"2011","unstructured":"Tokareva, N.N.: On the number of bent functions from iterative constructions: lower bounds and hypothesis. Adv. Math. Commun. 5(4), 609\u2013621 (2011)","journal-title":"Adv. Math. Commun."},{"key":"766_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-802318-1.00002-9","volume-title":"Bent functions: results and applications to cryptography","author":"N Tokareva","year":"2015","unstructured":"Tokareva, N.: Bent functions: results and applications to cryptography. Academic Press, Inc., Orlando, FL, United States (2015)"},{"key":"766_CR19","unstructured":"Tokareva, N.N.: On the set of derivatives of a Boolean bent function. Prikl. Diskretn. Mat. Suppl. 9, 327\u2013350 (2016) (in Russian)"},{"key":"766_CR20","doi-asserted-by":"crossref","unstructured":"Tsfasman, M.A., Vladuts, S.G.: Algebraic geometric codes. Basic notations. Mathematical Surveys and Monographs, vol. 139. American Mathematical Society, Providence (2007)","DOI":"10.1090\/surv\/139"},{"issue":"5","key":"766_CR21","doi-asserted-by":"publisher","first-page":"1607","DOI":"10.1007\/s10623-022-01167-4","volume":"91","author":"A Shaporenko","year":"2023","unstructured":"Shaporenko, A.: Derivatives of bent functions in connection with the bent sum decomposition problem. Des. Codes Cryptogr. 91(5), 1607\u20131625 (2023)","journal-title":"Des. Codes Cryptogr."},{"key":"766_CR22","doi-asserted-by":"publisher","first-page":"105149","DOI":"10.1016\/j.ic.2024.105149","volume":"297","author":"F Zhang","year":"2024","unstructured":"Zhang, F., Pasalic, E., Bapic, A., Wang, B.: Constructions of several special classes of cubic bent functions outside the completed Maiorana-McFarland class. Inform. Comput. 297, 105149 (2024)","journal-title":"Inform. Comput."}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00766-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-024-00766-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00766-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T11:27:01Z","timestamp":1737458821000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-024-00766-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["766"],"URL":"https:\/\/doi.org\/10.1007\/s12095-024-00766-3","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3447791\/v1","asserted-by":"object"}]},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"value":"1936-2447","type":"print"},{"value":"1936-2455","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11]]},"assertion":[{"value":"15 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}