{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T16:55:05Z","timestamp":1781369705769,"version":"3.54.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T00:00:00Z","timestamp":1766016000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T00:00:00Z","timestamp":1766016000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100000780","name":"European Commission","doi-asserted-by":"publisher","award":["P2022MPFRT"],"award-info":[{"award-number":["P2022MPFRT"]}],"id":[{"id":"10.13039\/501100000780","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Genet Program Evolvable Mach"],"published-print":{"date-parts":[[2026,6]]},"DOI":"10.1007\/s10710-025-09526-5","type":"journal-article","created":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T17:26:55Z","timestamp":1766078815000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A systematic study on the design of odd-sized highly nonlinear boolean functions via evolutionary algorithms"],"prefix":"10.1007","volume":"27","author":[{"given":"Claude","family":"Carlet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marko","family":"\u0189urasevi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Domagoj","family":"Jakobovic","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stjepan","family":"Picek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luca","family":"Mariot","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,18]]},"reference":[{"key":"9526_CR1","doi-asserted-by":"publisher","unstructured":"C. Carlet, Boolean functions for cryptography and coding theory. Cambridge University Press, Cambridge (2021). https:\/\/doi.org\/10.1017\/9781108606806","DOI":"10.1017\/9781108606806"},{"key":"9526_CR2","doi-asserted-by":"crossref","unstructured":"T. Helleseth, A. Kholosha, In: Blackburn, S.R., Gerke, S., Wildon, M. (eds.) Bent functions and their connections to combinatorics. London Mathematical Society Lecture Note Series, pp. 91\u2013126. Cambridge University Press, Cambridge (2013)","DOI":"10.1017\/CBO9781139506748.004"},{"issue":"2","key":"9526_CR3","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/S0019-9958(72)90376-2","volume":"20","author":"AM Kerdock","year":"1972","unstructured":"A.M. Kerdock, A class of low-rate nonlinear binary codes. Inf. Control 20(2), 182\u2013187 (1972)","journal-title":"Inf. Control"},{"key":"9526_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational complexity: a modern approach","author":"S Arora","year":"2009","unstructured":"S. Arora, B. Barak, Computational complexity: a modern approach, 1st edn. (Cambridge University Press, USA, 2009)","edition":"1"},{"issue":"4","key":"9526_CR5","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1162\/EVCO_a_00190","volume":"24","author":"S Picek","year":"2016","unstructured":"S. Picek, C. Carlet, S. Guilley, J.F. Miller, D. Jakobovic, Evolutionary algorithms for boolean functions in diverse domains of cryptography. Evol. Comput. 24(4), 667\u2013694 (2016)","journal-title":"Evol. Comput."},{"key":"9526_CR6","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1016\/j.asoc.2015.10.066","volume":"40","author":"S Picek","year":"2016","unstructured":"S. Picek, D. Jakobovic, J.F. Miller, L. Batina, M. Cupic, Cryptographic boolean functions: one output, many design criteria. Appl. Soft Comput. 40, 635\u2013653 (2016). https:\/\/doi.org\/10.1016\/j.asoc.2015.10.066","journal-title":"Appl. Soft Comput."},{"key":"9526_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2020.100646","volume":"54","author":"L Manzoni","year":"2020","unstructured":"L. Manzoni, L. Mariot, E. Tuba, Balanced crossover operators in genetic algorithms. Swarm Evol. Comput. 54, 100646 (2020)","journal-title":"Swarm Evol. Comput."},{"issue":"5","key":"9526_CR8","doi-asserted-by":"publisher","first-page":"1743","DOI":"10.1109\/TIT.2007.894696","volume":"53","author":"S Kavut","year":"2007","unstructured":"S. Kavut, S. Maitra, M.D. Yucel, Search for boolean functions with excellent profiles in the rotation symmetric class. IEEE Trans. Inf. Theory 53(5), 1743\u20131751 (2007). https:\/\/doi.org\/10.1109\/TIT.2007.894696","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9526_CR9","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-031-89991-1_2","volume-title":"Genetic programming","author":"C Carlet","year":"2025","unstructured":"C. Carlet, M. \u0110urasevi\u0107, D. Jakobovi\u0107, S. Picek, L. Mariot, A systematic evaluation of evolving highly nonlinear boolean functions in odd sizes, in Genetic programming. ed. by B. Xue, L. Manzoni, I. Bakurov (Springer, Cham, 2025), pp.18\u201334"},{"key":"9526_CR10","doi-asserted-by":"publisher","unstructured":"C. Carlet, M. Djurasevic, D. Jakobovic, L. Mariot, S. Picek, Evolving constructions for balanced, highly nonlinear boolean functions. In: Proceedings of the genetic and evolutionary computation conference. GECCO \u201922, pp. 1147\u20131155. Association for computing machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3512290.3528871","DOI":"10.1145\/3512290.3528871"},{"issue":"3","key":"9526_CR11","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1109\/18.568715","volume":"43","author":"X-D Hou","year":"1997","unstructured":"X.-D. Hou, On the norm and covering radius of the first-order Reed-Muller codes. IEEE Trans. Inf. Theory 43(3), 1025\u20131027 (1997). https:\/\/doi.org\/10.1109\/18.568715","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"10","key":"9526_CR12","doi-asserted-by":"publisher","first-page":"1567","DOI":"10.1016\/j.dam.2007.04.029","volume":"156","author":"P St\u0103nic\u0103","year":"2008","unstructured":"P. St\u0103nic\u0103, S. Maitra, Rotation symmetric boolean functions-count and cryptographic properties. Discret. Appl. Math. 156(10), 1567\u20131580 (2008). https:\/\/doi.org\/10.1016\/j.dam.2007.04.029","journal-title":"Discret. Appl. Math."},{"issue":"6","key":"9526_CR13","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1007\/s12095-023-00662-2","volume":"15","author":"M Djurasevic","year":"2023","unstructured":"M. Djurasevic, D. Jakobovic, L. Mariot, S. Picek, A survey of metaheuristic algorithms for the design of cryptographic boolean functions. Cryptogr. Commun. 15(6), 1171\u20131197 (2023)","journal-title":"Cryptogr. Commun."},{"key":"9526_CR14","doi-asserted-by":"crossref","unstructured":"J. Fuller, E. Dawson, W. Millan, Evolutionary generation of bent functions for cryptography. In: Proceedings of the IEEE congress on evolutionary computation, CEC 2003, Canberra, Australia, December 8-12, 2003, pp. 1655\u20131661. IEEE, Piscataway (2003)","DOI":"10.1109\/CEC.2003.1299871"},{"key":"9526_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BFb0028471","volume-title":"Information and communications security","author":"W Millan","year":"1997","unstructured":"W. Millan, A. Clark, E. Dawson, An effective genetic algorithm for finding highly nonlinear boolean functions, in Information and communications security. ed. by Y. Han, T. Okamoto, S. Qing (Springer, Berlin, Heidelberg, 1997), pp.149\u2013158"},{"key":"9526_CR16","doi-asserted-by":"publisher","unstructured":"S. Picek, D. Jakobovic, J.F. Miller, E. Marchiori, L. Batina, Evolutionary methods for the construction of cryptographic boolean functions, pp. 192\u2013204. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-16501-1_16","DOI":"10.1007\/978-3-319-16501-1_16"},{"key":"9526_CR17","doi-asserted-by":"crossref","unstructured":"S. Picek, K. Knezevic, L. Mariot, D. Jakobovic, A. Leporati, Evolving bent quaternary functions. In: 2018 IEEE congress on evolutionary computation, CEC 2018, Rio de Janeiro, Brazil, July 8-13, 2018, pp. 1\u20138. IEEE, ??? (2018)","DOI":"10.1109\/CEC.2018.8477677"},{"key":"9526_CR18","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":"L. Mariot, D. Jakobovic, A. Leporati, S. Picek, Hyper-bent boolean functions and evolutionary algorithms, in Genetic programming. ed. by L. Sekanina, T. Hu, N. Louren\u00e7o, H. Richter, P. Garc\u00eda-S\u00e1nchez (Springer, Cham, 2019), pp.262\u2013277"},{"key":"9526_CR19","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/10718964_20","volume-title":"Information security and privacy","author":"JA Clark","year":"2000","unstructured":"J.A. Clark, J.L. Jacob, Two-stage optimisation in the design of boolean functions, in Information security and privacy. ed. by E.P. Dawson, A. Clark, C. Boyd (Springer, Berlin, Heidelberg, 2000), pp.242\u2013254"},{"key":"9526_CR20","first-page":"231","volume":"29","author":"L Burnett","year":"2004","unstructured":"L. Burnett, W. Millan, E. Dawson, A. Clark, Simpler methods for generating better boolean functions with good cryptographic properties. Australas. J. Combin. 29, 231\u2013248 (2004)","journal-title":"Australas. J. Combin."},{"key":"9526_CR21","doi-asserted-by":"publisher","unstructured":"S. Picek, D. Jakobovic, M. Golub, Evolving cryptographically sound boolean functions. In: Proceedings of the 15th annual conference companion on genetic and evolutionary computation. GECCO \u201913 Companion, pp. 191\u2013192. Association for Computing Machinery, New York, NY, USA (2013). https:\/\/doi.org\/10.1145\/2464576.2464671","DOI":"10.1145\/2464576.2464671"},{"key":"9526_CR22","doi-asserted-by":"publisher","unstructured":"L. Mariot, A. Leporati, 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 \u201915, pp. 1425\u20131426. Association for computing machinery, New York, NY, USA (2015). https:\/\/doi.org\/10.1145\/2739482.2764674","DOI":"10.1145\/2739482.2764674"},{"key":"9526_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/978-3-540-25937-4_11","volume-title":"Fast Software Encryption, 11th International Workshop, FSE 2004, Delhi, India, February 5\u20137, 2004, Revised Papers","author":"P Stanica","year":"2004","unstructured":"P. Stanica, S. Maitra, J.A. Clark, Results on rotation symmetric bent and correlation immune boolean functions, in Fast Software Encryption, 11th International Workshop, FSE 2004, Delhi, India, February 5\u20137, 2004, Revised Papers, ed. by B.K. Roy, W. Meier. Lecture Notes in Computer Science, vol. 3017 (Springer, Berlin, Heidelberg, 2004), pp.161\u2013177"},{"key":"9526_CR24","doi-asserted-by":"crossref","unstructured":"S. Kavut, S. Maitra, S. Sarkar, M.D. Y\u00fccel, In: Barua, R., Lange, T. (eds.) Enumeration of 9-Variable rotation symmetric boolean functions having nonlinearity $$>$$ 240, pp. 266\u2013279. Springer, Berlin, Heidelberg (2006)","DOI":"10.1007\/11941378_19"},{"issue":"4","key":"9526_CR25","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.ic.2009.12.002","volume":"208","author":"S Kavut","year":"2010","unstructured":"S. Kavut, M.D. Y\u00fccel, 9-variable boolean functions with nonlinearity 242 in the generalized rotation symmetric class. Inf. Comput. 208(4), 341\u2013350 (2010). https:\/\/doi.org\/10.1016\/j.ic.2009.12.002","journal-title":"Inf. Comput."},{"key":"9526_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/978-3-031-56852-7_19","volume-title":"Applications of Evolutionary Computation - 27th European Conference, EvoApplications 2024, Held as Part of EvoStar 2024, Aberystwyth, UK, April 3\u20135, 2024, Proceedings, Part I","author":"C Carlet","year":"2024","unstructured":"C. Carlet, M. Durasevic, B. Gasperov, D. Jakobovic, L. Mariot, S. Picek, A new angle: On evolving rotation symmetric boolean functions, in Applications of Evolutionary Computation - 27th European Conference, EvoApplications 2024, Held as Part of EvoStar 2024, Aberystwyth, UK, April 3\u20135, 2024, Proceedings, Part I, ed. by S.L. Smith, J. Correia, C. Cintrano. Lecture Notes in Computer Science, vol. 14634 (Springer, Cham, 2024), pp.287\u2013302"},{"key":"9526_CR27","doi-asserted-by":"publisher","unstructured":"S. Picek, D. Jakobovic, Evolving algebraic constructions for designing bent boolean functions. In: Proceedings of the genetic and evolutionary computation conference 2016. GECCO \u201916, pp. 781\u2013788. Association for computing machinery, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2908812.2908915","DOI":"10.1145\/2908812.2908915"},{"issue":"3","key":"9526_CR28","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/s11047-022-09885-3","volume":"21","author":"L Mariot","year":"2022","unstructured":"L. Mariot, M. Saletta, A. Leporati, L. Manzoni, Heuristic search of (semi-)bent functions based on cellular automata. Nat. Comput. 21(3), 377\u2013391 (2022). https:\/\/doi.org\/10.1007\/s11047-022-09885-3","journal-title":"Nat. Comput."},{"key":"9526_CR29","unstructured":"R. Poli, W.B. Langdon, N.F. McPhee, A field guide to genetic programming. lulu.com, Durham (2008)"},{"key":"9526_CR30","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"D. Karaboga, B. Gorkemli, C. Ozturk, N. Karaboga, A comprehensive survey: artificial bee colony (abc) algorithm and applications. Artif. Intell. Rev. 42, 21\u201357 (2014)","journal-title":"Artif. Intell. Rev."},{"key":"9526_CR31","volume-title":"Clonal selection algorithms","author":"J Brownlee","year":"2007","unstructured":"J. Brownlee et al., Clonal selection algorithms (Swinburne University of Technology, Australia, Complex Intelligent Systems Laboratory, 2007)"},{"issue":"1","key":"9526_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/106365603321828970","volume":"11","author":"N Hansen","year":"2003","unstructured":"N. Hansen, S.D. M\u00fcller, P. Koumoutsakos, Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (cma-es). Evol. Comput. 11(1), 1\u201318 (2003)","journal-title":"Evol. Comput."},{"key":"9526_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2020.103479","volume":"90","author":"M Pant","year":"2020","unstructured":"M. Pant, H. Zaheer, L. Garcia-Hernandez, A. Abraham et al., Differential evolution: a review of more than two decades of research. Eng. Appl. Artif. Intell. 90, 103479 (2020)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"9526_CR34","doi-asserted-by":"crossref","unstructured":"V. Cutello, G. Nicosia, M. Pavone, Real coded clonal selection algorithm for unconstrained global optimization using a hybrid inversely proportional hypermutation operator. In: Proceedings of the 2006 ACM symposium on applied computing, pp. 950\u2013954 (2006)","DOI":"10.1145\/1141277.1141501"},{"key":"9526_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2021.107327","volume":"107","author":"D Jakobovic","year":"2021","unstructured":"D. Jakobovic, S. Picek, M.S.R. Martins, M. Wagner, Toward more efficient heuristic construction of boolean functions. Appl. Soft Comput. 107, 107327 (2021). https:\/\/doi.org\/10.1016\/j.asoc.2021.107327","journal-title":"Appl. Soft Comput."},{"issue":"1","key":"9526_CR36","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10710-023-09476-w","volume":"25","author":"J Husa","year":"2024","unstructured":"J. Husa, L. Sekanina, Semantic mutation operator for a fast and efficient design of bent boolean functions. Genet. Program Evolvable Mach. 25(1), 3 (2024)","journal-title":"Genet. Program Evolvable Mach."}],"container-title":["Genetic Programming and Evolvable Machines"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-025-09526-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10710-025-09526-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10710-025-09526-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T16:02:30Z","timestamp":1781366550000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10710-025-09526-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,18]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2026,6]]}},"alternative-id":["9526"],"URL":"https:\/\/doi.org\/10.1007\/s10710-025-09526-5","relation":{},"ISSN":["1389-2576","1573-7632"],"issn-type":[{"value":"1389-2576","type":"print"},{"value":"1573-7632","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,18]]},"assertion":[{"value":"23 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 December 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author has no conflict of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}}],"article-number":"1"}}