{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T20:07:53Z","timestamp":1766088473666,"version":"3.44.0"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031899904"},{"type":"electronic","value":"9783031899911"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-89991-1_2","type":"book-chapter","created":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T08:24:23Z","timestamp":1745310263000},"page":"18-34","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Systematic Evaluation of\u00a0Evolving Highly Nonlinear Boolean Functions in\u00a0Odd Sizes"],"prefix":"10.1007","author":[{"given":"Claude","family":"Carlet","sequence":"first","affiliation":[]},{"given":"Marko","family":"\u0110urasevi\u0107","sequence":"additional","affiliation":[]},{"given":"Domagoj","family":"Jakobovi\u0107","sequence":"additional","affiliation":[]},{"given":"Stjepan","family":"Picek","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Mariot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,4,18]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach, 1st edn. Cambridge University Press, USA (2009)","edition":"1"},{"key":"2_CR2","unstructured":"Brownlee, J., et al.: Clonal selection algorithms. Complex Intelligent Systems Laboratory, Swinburne University of Technology, Australia (2007)"},{"key":"2_CR3","first-page":"231","volume":"29","author":"L Burnett","year":"2004","unstructured":"Burnett, L., Millan, W., Dawson, E., Clark, A.: Simpler methods for generating better Boolean functions with good cryptographic properties. Australas. J. Combin. 29, 231\u2013248 (2004)","journal-title":"Australas. J. Combin."},{"key":"2_CR4","doi-asserted-by":"publisher","unstructured":"Carlet, C.: Boolean Functions for Cryptography and Coding Theory. Cambridge University Press, Cambridge (2021). https:\/\/doi.org\/10.1017\/9781108606806","DOI":"10.1017\/9781108606806"},{"key":"2_CR5","doi-asserted-by":"publisher","unstructured":"Carlet, C., Djurasevic, M., Jakobovic, D., Mariot, L., Picek, S.: Evolving constructions for balanced, highly nonlinear Boolean functions. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2022, pp. 1147\u20131155. Association for Computing Machinery, New York (2022). https:\/\/doi.org\/10.1145\/3512290.3528871","DOI":"10.1145\/3512290.3528871"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Carlet, C., Durasevic, M., Gasperov, B., Jakobovic, D., Mariot, L., Picek, S.: A new angle: on evolving rotation symmetric boolean functions. In: Smith, S.L., Correia, J., Cintrano, C. (eds.) Applications of Evolutionary Computation - 27th European Conference, EvoApplications 2024, Held as Part of EvoStar 2024, Aberystwyth, UK, 3\u20135 April 2024, Part I. Lecture Notes in Computer Science, vol. 14634, pp. 287\u2013302. Springer (2024)","DOI":"10.1007\/978-3-031-56852-7_19"},{"key":"2_CR7","doi-asserted-by":"publisher","unstructured":"Carlet, C., Jakobovic, D., Picek, S.: Evolutionary algorithms-assisted construction of cryptographic Boolean functions. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2021, pp. 565\u2013573. Association for Computing Machinery, New York (2021). https:\/\/doi.org\/10.1145\/3449639.3459362","DOI":"10.1145\/3449639.3459362"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/10718964_20","volume-title":"Information Security and Privacy","author":"JA Clark","year":"2000","unstructured":"Clark, J.A., Jacob, J.L.: Two-stage optimisation in the design of Boolean functions. In: Dawson, E.P., Clark, A., Boyd, C. (eds.) Information Security and Privacy, pp. 242\u2013254. Springer, Heidelberg (2000)"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Cutello, V., Nicosia, G., Pavone, M.: 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"},{"issue":"6","key":"2_CR10","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":"2_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-60590-8_5","volume-title":"Fast Software Encryption","author":"H Dobbertin","year":"1995","unstructured":"Dobbertin, H.: Construction of bent functions and balanced Boolean functions with high nonlinearity. In: Preneel, B. (ed.) Fast Software Encryption, pp. 61\u201374. Springer, Heidelberg (1995)"},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1162\/106365603321828970","volume":"11","author":"N Hansen","year":"2003","unstructured":"Hansen, N., M\u00fcller, S.D., Koumoutsakos, P.: 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":"2_CR13","doi-asserted-by":"crossref","unstructured":"Helleseth, T., Kholosha, A.: Bent Functions and Their Connections to Combinatorics. London Mathematical Society Lecture Note Series, pp. 91\u2013126. Cambridge University Press (2013)","DOI":"10.1017\/CBO9781139506748.004"},{"issue":"3","key":"2_CR14","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1109\/18.568715","volume":"43","author":"XD Hou","year":"1997","unstructured":"Hou, X.D.: 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"},{"key":"2_CR15","doi-asserted-by":"publisher","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 (2017). https:\/\/doi.org\/10.1145\/3067695.3084220","DOI":"10.1145\/3067695.3084220"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10462-012-9328-0","volume":"42","author":"D Karaboga","year":"2014","unstructured":"Karaboga, D., Gorkemli, B., Ozturk, C., Karaboga, N.: A comprehensive survey: artificial bee colony (ABC) algorithm and applications. Artif. Intell. Rev. 42, 21\u201357 (2014)","journal-title":"Artif. Intell. Rev."},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/11941378_19","volume-title":"Progress in Cryptology - INDOCRYPT 2006","author":"S Kavut","year":"2006","unstructured":"Kavut, S., Maitra, S., Sarkar, S., Y\u00fccel, M.D.: Enumeration of 9-variable rotation symmetric Boolean functions having nonlinearity $$\\ge $$ 240. In: Barua, R., Lange, T. (eds.) INDOCRYPT 2006. LNCS, vol. 4329, pp. 266\u2013279. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11941378_19"},{"issue":"5","key":"2_CR18","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). https:\/\/doi.org\/10.1109\/TIT.2007.894696","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR19","doi-asserted-by":"publisher","unstructured":"Kavut, S., Y\u00fccel, M.D.: 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, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540109002454","DOI":"10.1016\/j.ic.2009.12.002"},{"issue":"2","key":"2_CR20","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/S0019-9958(72)90376-2","volume":"20","author":"A Kerdock","year":"1972","unstructured":"Kerdock, A.: A class of low-rate nonlinear binary codes. Inf. Control 20(2), 182\u2013187 (1972)","journal-title":"Inf. Control"},{"issue":"1","key":"2_CR21","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1109\/TIT.2008.2008140","volume":"55","author":"WM Liu","year":"2009","unstructured":"Liu, W.M., Youssef, A.: On the existence of $$(10, 2, 7, 488)$$ resilient functions. IEEE Trans. Inf. Theory 55(1), 411\u2013412 (2009). https:\/\/doi.org\/10.1109\/TIT.2008.2008140","journal-title":"IEEE Trans. Inf. Theory"},{"key":"2_CR22","doi-asserted-by":"publisher","first-page":"100646","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":"2_CR23","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, Cham (2019)"},{"key":"2_CR24","doi-asserted-by":"publisher","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 (2015). https:\/\/doi.org\/10.1145\/2739482.2764674","DOI":"10.1145\/2739482.2764674"},{"key":"2_CR25","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.) Information and Communications Security, vol. 1334, pp. 149\u2013158. Springer, Heidelberg (1997)"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"103479","DOI":"10.1016\/j.engappai.2020.103479","volume":"90","author":"M Pant","year":"2020","unstructured":"Pant, M., Zaheer, H., Garcia-Hernandez, L., Abraham, A., 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":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"812","DOI":"10.1007\/978-3-319-10762-2_80","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"S Picek","year":"2014","unstructured":"Picek, S., Batina, L., Jakobovic, D.: Evolving DPA-resistant Boolean functions. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 812\u2013821. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2_80"},{"issue":"4","key":"2_CR28","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":"2_CR29","doi-asserted-by":"publisher","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 (2016). https:\/\/doi.org\/10.1145\/2908812.2908915","DOI":"10.1145\/2908812.2908915"},{"key":"2_CR30","doi-asserted-by":"publisher","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 (2013). https:\/\/doi.org\/10.1145\/2464576.2464671","DOI":"10.1145\/2464576.2464671"},{"key":"2_CR31","doi-asserted-by":"publisher","unstructured":"Picek, S., Jakobovic, D., Miller, J.F., Batina, L., Cupic, M.: 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, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S1568494615007103","DOI":"10.1016\/j.asoc.2015.10.066"},{"key":"2_CR32","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":"2_CR33","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":"2_CR34","unstructured":"Poli, R., Langdon, W.B., McPhee, N.F.: A Field Guide to Genetic Programming (2008). lulu.com"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Stanica, P., Maitra, S., Clark, J.A.: Results on rotation symmetric bent and correlation immune Boolean functions. In: Roy, B.K., Meier, W. (eds.) Fast Software Encryption, 11th International Workshop, FSE 2004, Delhi, India, 5\u20137 February 2004, Revised Papers. Lecture Notes in Computer Science, vol.\u00a03017, pp. 161\u2013177. Springer, Heidelberg (2004)","DOI":"10.1007\/978-3-540-25937-4_11"},{"key":"2_CR36","doi-asserted-by":"publisher","unstructured":"St\u0103nic\u0103, P., Maitra, S.: Rotation symmetric Boolean functions\u2014count and cryptographic properties. Discrete Appl. Math. 156(10), 1567\u20131580 (2008). https:\/\/doi.org\/10.1016\/j.dam.2007.04.029, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X07001734","DOI":"10.1016\/j.dam.2007.04.029"},{"issue":"9","key":"2_CR37","doi-asserted-by":"publisher","first-page":"2043","DOI":"10.1007\/s10623-019-00604-1","volume":"87","author":"Q Wang","year":"2019","unstructured":"Wang, Q., St\u0103nic\u0103, P.: Transparency order for Boolean functions: analysis and construction. Designs Codes Cryptogr. 87(9), 2043\u20132059 (2019). https:\/\/doi.org\/10.1007\/s10623-019-00604-1","journal-title":"Designs Codes Cryptogr."},{"key":"2_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2022\/8188533","volume":"2022","author":"Y Wang","year":"2022","unstructured":"Wang, Y., Gao, G., Yuan, Q.: Searching for cryptographically significant rotation symmetric Boolean functions by designing heuristic algorithms. Secur. Commun. Netw. 2022, 1\u20136 (2022). https:\/\/doi.org\/10.1155\/2022\/8188533","journal-title":"Secur. Commun. Netw."}],"container-title":["Lecture Notes in Computer Science","Genetic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-89991-1_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T12:12:12Z","timestamp":1757160732000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-89991-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031899904","9783031899911"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-89991-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EuroGP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Genetic Programming (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trieste","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurogp2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2025\/eurogp\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}