{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T20:04:18Z","timestamp":1766088258509,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031568510"},{"type":"electronic","value":"9783031568527"}],"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-56852-7_19","type":"book-chapter","created":{"date-parts":[[2024,3,20]],"date-time":"2024-03-20T20:02:22Z","timestamp":1710964942000},"page":"287-302","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A New Angle: On Evolving Rotation Symmetric Boolean Functions"],"prefix":"10.1007","author":[{"given":"Claude","family":"Carlet","sequence":"first","affiliation":[]},{"given":"Marko","family":"Durasevic","sequence":"additional","affiliation":[]},{"given":"Bruno","family":"Gasperov","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,21]]},"reference":[{"key":"19_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":"19_CR2","unstructured":"Brownlee, J., et al.: Clonal selection algorithms. Swinburne University of Technology, Australia, Complex Intelligent Systems Laboratory (2007)"},{"key":"19_CR3","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":"19_CR4","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"},{"key":"19_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. Crypt. Commun. 15(6), 1171\u20131197 (2023). https:\/\/doi.org\/10.1007\/s12095-023-00662-2","DOI":"10.1007\/s12095-023-00662-2"},{"key":"19_CR6","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"},{"issue":"1","key":"19_CR7","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":"19_CR8","doi-asserted-by":"publisher","unstructured":"dong Hou, X.: On the norm and covering radius of the first-order reed-muller codes. IEEE Trans. Inform. Theory 43(3), 1025\u20131027 (1997). https:\/\/doi.org\/10.1109\/18.568715","DOI":"10.1109\/18.568715"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-10762-2","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","year":"2014","unstructured":"Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.): PPSN 2014. LNCS, vol. 8672. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2"},{"key":"19_CR10","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, p. 1825\u20131832. GECCO 2017, Association for Computing Machinery, New York, NY, USA (2017). https:\/\/doi.org\/10.1145\/3067695.3084220","DOI":"10.1145\/3067695.3084220"},{"key":"19_CR11","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."},{"issue":"5","key":"19_CR12","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":"19_CR13","doi-asserted-by":"publisher","unstructured":"Kavut, S., Y\u00fccel, M.D.: 9-variable boolean functions with nonlinearity 242 in the generalized rotation symmetric class. Inform. 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":"19_CR14","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":"19_CR15","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":"19_CR16","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":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-662-49890-3_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"P M\u00e9aux","year":"2016","unstructured":"M\u00e9aux, P., Journault, A., Standaert, F.-X., Carlet, C.: Towards stream ciphers for efficient FHE with low-noise ciphertexts. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 311\u2013343. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49890-3_13"},{"key":"19_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-32595-8","volume-title":"Bent Functions","author":"S Mesnager","year":"2016","unstructured":"Mesnager, S.: Bent Functions. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-32595-8"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0028456","volume-title":"Information and Communications Security","year":"1997","unstructured":"Han, Y., Okamoto, T., Qing, S. (eds.): ICICS 1997. LNCS, vol. 1334. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0028456"},{"issue":"6","key":"19_CR20","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":"19_CR21","doi-asserted-by":"publisher","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":"19_CR22","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1109\/TIT.2004.825505","volume":"50","author":"K Paterson","year":"2004","unstructured":"Paterson, K.: On codes with low peak-to-average power ratio for multicode CDMA. Inf. Theory IEEE Trans. 50, 550\u2013559 (2004)","journal-title":"Inf. Theory IEEE Trans."},{"key":"19_CR23","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 2016, Association for Computing Machinery, New York, NY, USA (2016). https:\/\/doi.org\/10.1145\/2908812.2908915","DOI":"10.1145\/2908812.2908915"},{"key":"19_CR24","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 2022, Association for Computing Machinery, New York, NY, USA (2022). https:\/\/doi.org\/10.1145\/3520304.3534087","DOI":"10.1145\/3520304.3534087"},{"key":"19_CR25","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":"19_CR26","doi-asserted-by":"crossref","unstructured":"Poli, R., Langdon, W.B., McPhee, N.F.: A Field Guide to Genetic Programming. lulu.com (2008)","DOI":"10.1145\/1274000.1274124"},{"issue":"3","key":"19_CR27","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1016\/0097-3165(76)90024-8","volume":"20","author":"O Rothaus","year":"1976","unstructured":"Rothaus, O.: On \u201cbent\" functions. J. Comb. Theory Ser. A 20(3), 300\u2013305 (1976)","journal-title":"J. Comb. Theory Ser. A"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-540-25937-4_11","volume-title":"Fast Software Encryption","author":"P St\u0103nic\u0103","year":"2004","unstructured":"St\u0103nic\u0103, P., Maitra, S., Clark, J.A.: Results on rotation symmetric bent and correlation immune Boolean functions. In: Roy, B., Meier, W. (eds.) FSE 2004. LNCS, vol. 3017, pp. 161\u2013177. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-25937-4_11"},{"key":"19_CR29","doi-asserted-by":"publisher","unstructured":"St\u0103nic\u0103, P., Maitra, S.: Rotation symmetric Boolean functions-count 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"},{"key":"19_CR30","doi-asserted-by":"publisher","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","DOI":"10.1155\/2022\/8188533"},{"key":"19_CR31","unstructured":"Yang, M., Meng, Q., Zhang, H.: Evolutionary design of trace form bent functions. Cryptology ePrint Archive, Paper 2005\/322 (2005). https:\/\/eprint.iacr.org\/2005\/322"}],"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-031-56852-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T18:55:35Z","timestamp":1731610535000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-56852-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031568510","9783031568527"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-56852-7_19","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":"21 March 2024","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":"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 March 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 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":"evoapplications2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2024\/evoapps\/","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":"Easy Chair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"77","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":"51","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":"66% - 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.4","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":"1.7","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)"}}]}}