{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T04:10:27Z","timestamp":1778213427825,"version":"3.51.4"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032236036","type":"print"},{"value":"9783032236043","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-23604-3_14","type":"book-chapter","created":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T03:21:57Z","timestamp":1778210517000},"page":"216-232","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Counts and\u00a0Densities of\u00a0Homogeneous Bent Functions: An Evolutionary Approach"],"prefix":"10.1007","author":[{"given":"Claude","family":"Carlet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marko","family":"\u00d0urasevi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Domagoj","family":"Jakobovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Mariot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stjepan","family":"Picek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexandr","family":"Polujan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,5,9]]},"reference":[{"key":"14_CR1","volume-title":"Boolean Functions for Cryptography and Coding Theory","author":"C Carlet","year":"2021","unstructured":"Carlet, C.: Boolean Functions for Cryptography and Coding Theory. Cambridge University Press, Cambridge (2021)"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Carlet, C., Durasevic, M., Jakobovic, D., Mariot, L., Picek, S.: Degree is important: on evolving homogeneous Boolean functions, GECCO 2025 Companion, pp. 795\u2013798. Association for Computing Machinery, New York, NY, USA (2025)","DOI":"10.1145\/3712255.3726779"},{"issue":"1\u20133","key":"14_CR3","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1016509410000","volume":"26","author":"C Charnes","year":"2002","unstructured":"Charnes, C., R\u00f6tteler, M., Beth, T.: Homogeneous bent functions, invariants, and designs. Des. Codes Cryptogr. 26(1\u20133), 139\u2013154 (2002)","journal-title":"Des. Codes Cryptogr."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Clark, J.A., Jacob, J.L., Maitra, S., St\u0103nic\u0103, P.: Almost Boolean functions: the design of Boolean functions by spectral inversion. In: The 2003 Congress on Evolutionary Computation, CEC 2003, vol.\u00a03, pp. 2173\u20132180 (2003)","DOI":"10.1109\/CEC.2003.1299941"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/3-540-36231-2_20","volume-title":"Progress in Cryptology \u2014 INDOCRYPT 2002","author":"JA Clark","year":"2002","unstructured":"Clark, J.A., Jacob, J.L., Stepney, S., Maitra, S., Millan, W.: Evolving Boolean functions satisfying multiple criteria. In: Menezes, A., Sarkar, P. (eds.) INDOCRYPT 2002. LNCS, vol. 2551, pp. 246\u2013259. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36231-2_20"},{"issue":"6","key":"14_CR6","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1007\/s12095-023-00662-2","volume":"15","author":"M Djurasevic","year":"2023","unstructured":"Djurasevic, M., Jakobovic, D., Mariot, L., Picek, S.: A survey of metaheuristic algorithms for the design of cryptographic Boolean functions. Cryptogr. Commun. 15(6), 1171\u20131197 (2023)","journal-title":"Cryptogr. Commun."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Fuller, J., Dawson, E., Millan, W.: Evolutionary generation of bent functions for cryptography. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2003, Canberra, Australia, 8\u201312 December 2003, pp. 1655\u20131661. IEEE (2003)","DOI":"10.1109\/CEC.2003.1299871"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-319-10762-2_41","volume-title":"Parallel Problem Solving from Nature - PPSN XIII","author":"R Hrbacek","year":"2014","unstructured":"Hrbacek, R., Dvorak, V.: Bent function synthesis by means of cartesian genetic programming. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) Parallel Problem Solving from Nature - PPSN XIII, pp. 414\u2013423. Springer International Publishing, Cham (2014)"},{"key":"14_CR9","doi-asserted-by":"crossref","unstructured":"Husa, J., Dobai, R.: Designing bent Boolean functions with parallelized linear genetic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO 2017, pp. 1825\u20131832. Association for Computing Machinery, New York, NY, USA (2017)","DOI":"10.1145\/3067695.3084220"},{"issue":"5","key":"14_CR10","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1109\/TIT.2007.894696","volume":"53","author":"S Kavut","year":"2007","unstructured":"Kavut, S., Maitra, S., Yucel, M.D.: Search for Boolean functions with excellent profiles in the rotation symmetric class. IEEE Trans. Inf. Theory 53(5), 1743\u20131751 (2007)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"14_CR11","unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. Elsevier, Amsterdam, North Holland (1977). ISBN: 978-0-444-85193-2"},{"key":"14_CR12","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100646","volume":"54","author":"L Manzoni","year":"2020","unstructured":"Manzoni, L., Mariot, L., Tuba, E.: Balanced crossover operators in genetic algorithms. Swarm Evol. Comput. 54, 100646 (2020)","journal-title":"Swarm Evol. Comput."},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-030-16670-0_17","volume-title":"Genetic Programming","author":"L Mariot","year":"2019","unstructured":"Mariot, L., Jakobovic, D., Leporati, A., Picek, S.: Hyper-bent Boolean functions and evolutionary algorithms. In: Sekanina, L., Hu, T., Louren\u00e7o, N., Richter, H., Garc\u00eda-S\u00e1nchez, P. (eds.) Genetic Programming, pp. 262\u2013277. Springer International Publishing, Cham (2019)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-26841-5_3","volume-title":"Theory and Practice of Natural Computing","author":"L Mariot","year":"2015","unstructured":"Mariot, L., Leporati, A.: A genetic algorithm for evolving plateaued cryptographic Boolean functions. In: Dediu, A.-H., Magdalena, L., Mart\u00edn-Vide, C. (eds.) TPNC 2015. LNCS, vol. 9477, pp. 33\u201345. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26841-5_3"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Mariot, L., Leporati, A.: Heuristic search by particle swarm optimization of Boolean functions for cryptographic applications. In: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation, GECCO Companion 2015, pp. 1425\u20131426. Association for Computing Machinery, New York, NY, USA (2015)","DOI":"10.1145\/2739482.2764674"},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s11047-022-09885-3","volume":"21","author":"L Mariot","year":"2022","unstructured":"Mariot, L., Saletta, M., Leporati, A., Manzoni, L.: Heuristic search of (semi-)bent functions based on cellular automata. Nat. Comput. 21(3), 377\u2013391 (2022)","journal-title":"Nat. Comput."},{"key":"14_CR17","unstructured":"McLaughlin, J., Clark, J.A.: Evolving balanced Boolean functions with optimal resistance to algebraic and fast algebraic attacks, maximal algebraic degree, and very high nonlinearity. Cryptology ePrint Archive, Report 2013\/011 (2013). https:\/\/eprint.iacr.org\/2013\/011"},{"issue":"3","key":"14_CR18","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s11432-007-0030-9","volume":"50","author":"Q Meng","year":"2007","unstructured":"Meng, Q., Zhang, H., Yang, M., Wang, Z.: Analysis of affinely equivalent Boolean functions. Sci. China Ser. F Inf. Sci. 50(3), 299\u2013306 (2007)","journal-title":"Sci. China Ser. F Inf. Sci."},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BFb0028471","volume-title":"Information and Communications Security","author":"W Millan","year":"1997","unstructured":"Millan, W., Clark, A., Dawson, E.: An effective genetic algorithm for finding highly nonlinear Boolean functions. In: Han, Y., Okamoto, T., Qing, S. (eds.) ICICS 1997. LNCS, vol. 1334, pp. 149\u2013158. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0028471"},{"key":"14_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/BFb0054148","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"W Millan","year":"1998","unstructured":"Millan, W., Clark, A., Dawson, E.: Heuristic design of cryptographically strong balanced Boolean functions. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 489\u2013499. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054148"},{"issue":"4","key":"14_CR21","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1162\/EVCO_a_00190","volume":"24","author":"S Picek","year":"2016","unstructured":"Picek, S., Carlet, C., Guilley, S., Miller, J.F., Jakobovic, D.: Evolutionary algorithms for Boolean functions in diverse domains of cryptography. Evol. Comput. 24(4), 667\u2013694 (2016)","journal-title":"Evol. Comput."},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Picek, S., Jakobovic, D.: Evolving algebraic constructions for designing bent Boolean functions. In: Proceedings of the Genetic and Evolutionary Computation Conference 2016. GECCO 2016, pp. 781\u2013788. Association for Computing Machinery, New York, NY, USA (2016)","DOI":"10.1145\/2908812.2908915"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Picek, S., Jakobovic, D., Golub, M.: Evolving cryptographically sound Boolean functions. In: Proceedings of the 15th Annual Conference Companion on Genetic and Evolutionary Computation, GECCO 2013 Companion, pp. 191\u2013192. Association for Computing Machinery, New York, NY, USA (2013)","DOI":"10.1145\/2464576.2464671"},{"key":"14_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-319-16501-1_16","volume-title":"Genetic Programming","author":"S Picek","year":"2015","unstructured":"Picek, S., Jakobovic, D., Miller, J.F., Marchiori, E., Batina, L.: Evolutionary methods for the construction of cryptographic Boolean functions. In: Machado, P., et al. (eds.) EuroGP 2015. LNCS, vol. 9025, pp. 192\u2013204. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16501-1_16"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Picek, S., Knezevic, K., Mariot, L., Jakobovic, D., Leporati, A.: Evolving bent quaternary functions. In: 2018 IEEE Congress on Evolutionary Computation, CEC 2018, Rio de Janeiro, Brazil, 8\u201313 July 2018, pp.\u00a01\u20138. IEEE (2018)","DOI":"10.1109\/CEC.2018.8477677"},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"822","DOI":"10.1007\/978-3-319-10762-2_81","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"S Picek","year":"2014","unstructured":"Picek, S., Marchiori, E., Batina, L., Jakobovic, D.: Combining evolutionary computation and algebraic constructions to find cryptography-relevant Boolean functions. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 822\u2013831. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2_81"},{"key":"14_CR27","unstructured":"Poli, R., Langdon, W.B., McPhee, N.F.: A Field Guide to Genetic Programming. Lulu Enterprises Ltd., UK (2008). www.gp-field-guide.org.uk"},{"issue":"9","key":"14_CR28","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 Crypt. 88(9), 1701\u20131722 (2020)","journal-title":"Des. Codes Crypt."},{"key":"14_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/3-540-48970-3_3","volume-title":"Information Security and Privacy","author":"C Qu","year":"1999","unstructured":"Qu, C., Seberry, J., Pieprzyk, J.: On the symmetric property of homogeneous Boolean functions. In: Pieprzyk, J., Safavi-Naini, R., Seberry, J. (eds.) ACISP 1999. LNCS, vol. 1587, pp. 26\u201335. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48970-3_3"},{"key":"14_CR30","first-page":"233","volume":"22","author":"J Seberry","year":"2000","unstructured":"Seberry, J., Xia, T., Pieprzyk, J.: Construction of cubic homogeneous Boolean bent functions. Australas. J Comb. 22, 233\u2013246 (2000)","journal-title":"Australas. J Comb."},{"key":"14_CR31","unstructured":"Wolfram Research Inc.: Mathematica, Version 14.3, Champaign, IL (2025). https:\/\/www.wolfram.com\/mathematica"},{"key":"14_CR32","doi-asserted-by":"crossref","unstructured":"Xia, T., Seberry, J., Pieprzyk, J., Charnes, C.: Homogeneous bent functions of degree $$n$$ in $$2n$$ variables do not exist for $$n>3$$. Discret. Appl. Math. 142(1), 127\u2013132 (2004)","DOI":"10.1016\/j.dam.2004.02.006"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-23604-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T03:22:08Z","timestamp":1778210528000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-23604-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032236036","9783032236043"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-23604-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"9 May 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Toulouse","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2026\/evoapps\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}