{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T22:26:52Z","timestamp":1757456812170,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031302282"},{"type":"electronic","value":"9783031302299"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-30229-9_16","type":"book-chapter","created":{"date-parts":[[2023,4,8]],"date-time":"2023-04-08T19:02:39Z","timestamp":1680980559000},"page":"237-252","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Evolution of\u00a0Boomerang Uniformity in\u00a0Cryptographic S-boxes"],"prefix":"10.1007","author":[{"given":"Marko","family":"Durasevic","sequence":"first","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":"Sihem","family":"Mesnager","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stjepan","family":"Picek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,4,9]]},"reference":[{"key":"16_CR1","unstructured":"Bertoni, G., Daemen, J., Peeters, M., Assche, G.V.: The Keccak reference, January 2011. http:\/\/keccak.noekeon.org\/"},{"key":"16_CR2","doi-asserted-by":"publisher","unstructured":"Boura, C., Canteaut, A.: On the boomerang uniformity of cryptographic sboxes. IACR Transactions on Symmetric Cryptology 2018(3), 290\u2013310 (2018). https:\/\/doi.org\/10.13154\/tosc.v2018.i3.290-310, https:\/\/tosc.iacr.org\/index.php\/ToSC\/article\/view\/7304","DOI":"10.13154\/tosc.v2018.i3.290-310"},{"key":"16_CR3","doi-asserted-by":"publisher","unstructured":"Carlet, C.: Boolean Functions for Cryptography and Coding Theory. Cambridge University Press (2021). https:\/\/doi.org\/10.1017\/9781108606806","DOI":"10.1017\/9781108606806"},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Carlet, C., Charpin, P., Zinoviev, V.: Codes, bent functions and permutations suitable for des-like cryptosystems. Des. Codes Cryptogr. 15(2), 125\u2013156 (1998). https:\/\/doi.org\/10.1023\/A:1008344232130","DOI":"10.1023\/A:1008344232130"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"683","DOI":"10.1007\/978-3-319-78375-8_22","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"C Cid","year":"2018","unstructured":"Cid, C., Huang, T., Peyrin, T., Sasaki, Y., Song, L.: Boomerang connectivity table: a new cryptanalysis tool. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 683\u2013714. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78375-8_22"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Clark, J.A., Jacob, J.L., Stepney, S.: The design of s-boxes by simulated annealing. In: Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No. 04TH8753), vol. 2, pp. 1533\u20131537 (2004)","DOI":"10.1109\/CEC.2004.1331078"},{"issue":"2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2002","unstructured":"Deb, K., Agrawal, S., Pratap, A., Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6(2), 182\u2013197 (2002)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Ege, B., Papagiannopoulos, K., Batina, L., Picek, S.: Improving DPA resistance of s-boxes: how far can we go? In: 2015 IEEE International Symposium on Circuits and Systems (ISCAS), pp. 2013\u20132016 (2015)","DOI":"10.1109\/ISCAS.2015.7169071"},{"key":"16_CR9","unstructured":"Kazymyrov, O., Kazymyrova, V., Oliynykov, R.: A method for generation of high-nonlinear s-boxes based on gradient descent. Cryptology ePrint Archive, Report 2013\/578 (2013). https:\/\/eprint.iacr.org\/2013\/578"},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s12095-018-0311-8","volume":"11","author":"L Mariot","year":"2018","unstructured":"Mariot, L., Picek, S., Leporati, A., Jakobovic, D.: Cellular automata based S-boxes. Cryptogr. Commun. 11(1), 41\u201362 (2018). https:\/\/doi.org\/10.1007\/s12095-018-0311-8","journal-title":"Cryptogr. Commun."},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Mesnager, S., Tang, C., Xiong, M.: On the boomerang uniformity of quadratic permutations. Designs, Codes and Cryptography 88(10), 2233\u20132246 (2020). https:\/\/doi.org\/10.1007\/s10623-020-00775-2","DOI":"10.1007\/s10623-020-00775-2"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1007\/3-540-46416-6_32","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"K Nyberg","year":"1991","unstructured":"Nyberg, K.: Perfect nonlinear S-boxes. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 378\u2013386. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_32"},{"issue":"4","key":"16_CR13","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1162\/EVCO_a_00191","volume":"24","author":"S Picek","year":"2016","unstructured":"Picek, S., Cupic, M., Rotim, L.: A new cost function for evolution of S-boxes. Evol. Comput. 24(4), 695\u2013718 (2016)","journal-title":"Evol. Comput."},{"key":"16_CR14","doi-asserted-by":"publisher","unstructured":"Picek, S., Ege, B., Batina, L., Jakobovic, D., Chmielewski, U., Golub, M.: On using genetic algorithms for intrinsic side-channel resistance: The case of AES s-box. In: Proceedings of the First Workshop on Cryptography and Security in Computing Systems. CS2 2014, pp. 13\u201318. Association for Computing Machinery, New York, NY, USA (2014). https:\/\/doi.org\/10.1145\/2556315.2556319","DOI":"10.1145\/2556315.2556319"},{"key":"16_CR15","doi-asserted-by":"publisher","unstructured":"Picek, S., Jakobovic, D.: On the design of s-box constructions with genetic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO 2019, New York, NY, USA, pp. 395\u2013396. Association for Computing Machinery (2019). https:\/\/doi.org\/10.1145\/3319619.3322040","DOI":"10.1145\/3319619.3322040"},{"key":"16_CR16","doi-asserted-by":"publisher","unstructured":"Picek, S., Mariot, L., Leporati, A., Jakobovic, D.: Evolving s-boxes based on cellular automata with genetic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference Companion. GECCO 2017, New York, NY, USA, pp. 251\u2013252. Association for Computing Machinery (2017). https:\/\/doi.org\/10.1145\/3067695.3076084","DOI":"10.1145\/3067695.3076084"},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Picek, S., Mariot, L., Yang, B., Jakobovic, D., Mentens, N.: Design of s-boxes defined with cellular automata rules. In: Proceedings of the Computing Frontiers Conference. CF 2017, New York, NY, USA, pp. 409\u2013414. Association for Computing Machinery (2017). https:\/\/doi.org\/10.1145\/3075564.3079069","DOI":"10.1145\/3075564.3079069"},{"key":"16_CR18","doi-asserted-by":"publisher","unstructured":"Picek, S., Miller, J.F., Jakobovic, D., Batina, L.: Cartesian genetic programming approach for generating substitution boxes of different sizes. In: Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation. GECCO Companion 2015, New York, NY, USA, pp. 1457\u20131458. Association for Computing Machinery (2015). https:\/\/doi.org\/10.1145\/2739482.2764698","DOI":"10.1145\/2739482.2764698"},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/978-3-319-69453-5_9","volume-title":"Selected Areas in Cryptography \u2013 SAC 2016","author":"S Picek","year":"2017","unstructured":"Picek, S., Yang, B., Rozic, V., Mentens, N.: On the construction of hardware-friendly $$4\\times 4$$ and $$5\\times 5$$ s-boxes. In: Avanzi, R., Heys, H. (eds.) SAC 2016. LNCS, vol. 10532, pp. 161\u2013179. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69453-5_9"},{"key":"16_CR20","unstructured":"Poli, R., Langdon, W.B., McPhee, N.F.: A field guide to genetic programming. Published via http:\/\/lulu.com and freely available at http:\/\/www.gp-field-guide.org.uk (2008). (With contributions by J. R. Koza)"},{"issue":"1","key":"16_CR21","first-page":"23","volume":"19","author":"P Tesa\u0159","year":"2010","unstructured":"Tesa\u0159, P.: A new method for generating high non-linearity S-boxes. Radioengineering 19(1), 23\u201326 (2010)","journal-title":"Radioengineering"},{"issue":"9","key":"16_CR22","doi-asserted-by":"publisher","first-page":"1959","DOI":"10.1007\/s10623-020-00785-0","volume":"88","author":"S Tian","year":"2020","unstructured":"Tian, S., Boura, C., Perrin, L.: Boomerang uniformity of popular S-box constructions. Des. Codes Crypt. 88(9), 1959\u20131989 (2020). https:\/\/doi.org\/10.1007\/s10623-020-00785-0","journal-title":"Des. Codes Crypt."},{"key":"16_CR23","doi-asserted-by":"publisher","unstructured":"Vla\u0161i\u0107, I., Durasevi\u0107, M., Jakobovi\u0107, D.: Improving genetic algorithm performance by population initialisation with dispatching rules. Comput. Ind. Eng. 137, 106030 (2019). https:\/\/doi.org\/10.1016\/j.cie.2019.106030, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0360835219304899","DOI":"10.1016\/j.cie.2019.106030"},{"key":"16_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/3-540-48519-8_12","volume-title":"Fast Software Encryption","author":"D Wagner","year":"1999","unstructured":"Wagner, D.: The boomerang attack. In: Knudsen, L. (ed.) FSE 1999. LNCS, vol. 1636, pp. 156\u2013170. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48519-8_12"}],"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-30229-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,17]],"date-time":"2024-10-17T23:02:50Z","timestamp":1729206170000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-30229-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031302282","9783031302299"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-30229-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"9 April 2023","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":"Brno","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 April 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 April 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2023\/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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","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":"37","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":"14","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":"47% - 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","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":"3","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)"}}]}}