{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:28:10Z","timestamp":1743143290420,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031569562"},{"type":"electronic","value":"9783031569579"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-56957-9_10","type":"book-chapter","created":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T00:04:24Z","timestamp":1711584264000},"page":"161-175","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Look into the Mirror: Evolving Self-dual Bent Boolean Functions"],"prefix":"10.1007","author":[{"given":"Claude","family":"Carlet","sequence":"first","affiliation":[]},{"given":"Marko","family":"Durasevic","sequence":"additional","affiliation":[]},{"given":"Domagoj","family":"Jakobovic","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Mariot","sequence":"additional","affiliation":[]},{"given":"Stjepan","family":"Picek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,3,28]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Adams, C.: The CAST-128 Encryption Algorithm. RFC 2144, May 1997. https:\/\/doi.org\/10.17487\/RFC2144, https:\/\/www.rfc-editor.org\/info\/rfc2144","DOI":"10.17487\/RFC2144"},{"key":"10_CR2","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"},{"issue":"1","key":"10_CR3","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."},{"key":"10_CR4","unstructured":"Dillon, J.F.: Elementary Hadamard difference sets. Ph.D. thesis, Univ. of Maryland (1974)"},{"key":"10_CR5","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1007\/s12095-023-00662-2","DOI":"10.1007\/s12095-023-00662-2"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","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.) FSE 1994. LNCS, vol. 1008, pp. 61\u201374. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60590-8_5"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-319-10762-2_41","volume-title":"Parallel Problem Solving from Nature \u2013 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.) PPSN 2014. LNCS, vol. 8672, pp. 414\u2013423. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2_41"},{"key":"10_CR8","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, pp. 1825\u20131832. GECCO \u201917, Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3067695.3084220","DOI":"10.1145\/3067695.3084220"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Jakobovic, D., Picek, S., Martins, M.S., Wagner, M.: Toward more efficient heuristic construction of Boolean functions. Appl. Soft Comput. 107, 107327 (2021). https:\/\/doi.org\/10.1016\/j.asoc.2021.107327, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S1568494621002507","DOI":"10.1016\/j.asoc.2021.107327"},{"issue":"2","key":"10_CR10","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"},{"key":"10_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":"10_CR12","series-title":"Lecture Notes in Computer Science","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.) EuroGP 2019. LNCS, vol. 11451, pp. 262\u2013277. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16670-0_17"},{"key":"10_CR13","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"},{"issue":"3","key":"10_CR14","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":"10_CR15","doi-asserted-by":"publisher","unstructured":"McFarland, R.L.: A family of difference sets in non-cyclic groups. J. Comb. Theory Ser. A 15(1), 1\u201310 (1973). https:\/\/doi.org\/10.1016\/0097-3165(73)90031-9, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0097316573900319","DOI":"10.1016\/0097-3165(73)90031-9"},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Mesnager, S.: Bent Functions. Springer International Publishing, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32595-8","DOI":"10.1007\/978-3-319-32595-8"},{"key":"10_CR17","unstructured":"Mesnager, S.: Linear codes from functions. In: Huffman, W.C., Sol\u00e9, J.L.K.P. (eds.) A Concise Encyclopedia of Coding Theory. p. 94 pages in Chapter 20. Press\/Taylor and Francis Group (2021)"},{"key":"10_CR18","unstructured":"Miller, J.F.: An empirical study of the efficiency of learning Boolean functions using a cartesian genetic programming approach. In: Proceedings of the 1st Annual Conference on Genetic and Evolutionary Computation, vol. 2, pp. 1135\u20131142. GECCO\u201999, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (1999)"},{"issue":"6","key":"10_CR19","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1109\/TIT.1982.1056589","volume":"28","author":"J Olsen","year":"1982","unstructured":"Olsen, J., Scholtz, R., Welch, L.: Bent-function sequences. IEEE Trans. Inf. Theory 28(6), 858\u2013864 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10_CR20","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, pp. 781\u2013788. GECCO \u201916, Association for Computing Machinery, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2908812.2908915","DOI":"10.1145\/2908812.2908915"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"Picek, S., Jakobovic, D.: Evolutionary computation and machine learning in security. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1572\u20131601. GECCO \u201922, Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3520304.3534087","DOI":"10.1145\/3520304.3534087"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Picek, S., Jakobovic, D., O\u2019Reilly, U.M.: Cryptobench: benchmarking evolutionary algorithms with cryptographic problems. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion, pp. 1597\u20131604. GECCO \u201917, Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3067695.3082535","DOI":"10.1145\/3067695.3082535"},{"key":"10_CR23","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. 1\u20138. IEEE (2018)","DOI":"10.1109\/CEC.2018.8477677"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Picek, S., Sisejkovic, D., Jakobovic, D.: Immunological algorithms paradigm for construction of Boolean functions with good cryptographic properties. Eng. Appl. Artif. Intell. 62, 320\u2013330 (2017). https:\/\/doi.org\/10.1016\/j.engappai.2016.11.002, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0952197616302044","DOI":"10.1016\/j.engappai.2016.11.002"},{"key":"10_CR25","unstructured":"Poli, R., Langdon, W.B., McPhee, N.F.: A Field Guide to Genetic Programming. Lulu Enterprises Ltd., UK (2008)"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Rothaus, O.: On bent functions. J. Comb. Theory Ser. A 20(3), 300\u2013305 (1976)","DOI":"10.1016\/0097-3165(76)90024-8"},{"key":"10_CR27","doi-asserted-by":"publisher","unstructured":"Yan, L., et al.: IGA: an improved genetic algorithm to construct weightwise (almost) perfectly balanced Boolean functions with high weightwise nonlinearity. In: Proceedings of the 2023 ACM Asia Conference on Computer and Communications Security, pp. 638\u2013648. ASIA CCS \u201923, Association for Computing Machinery, New York, NY, USA (2023). https:\/\/doi.org\/10.1145\/3579856.3590337","DOI":"10.1145\/3579856.3590337"}],"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-56957-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T00:06:25Z","timestamp":1711584385000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56957-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031569562","9783031569579"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56957-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"28 March 2024","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":"Aberystwyth","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"eurogp2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2024\/eurogp\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"13","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"54% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.666","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.447","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}