{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:06:10Z","timestamp":1742954770591,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031843556"},{"type":"electronic","value":"9783031843563"}],"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-84356-3_10","type":"book-chapter","created":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T13:46:52Z","timestamp":1740491212000},"page":"118-129","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Utilizing Evolutionary Algorithms for the Synthesis of Cryptographic Substitution Patterns"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2331-6326","authenticated-orcid":false,"given":"Oleksandr","family":"Kuznetsov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9386-2547","authenticated-orcid":false,"given":"Nikolay","family":"Poluyanenko","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8893-9244","authenticated-orcid":false,"given":"Emanuele","family":"Frontoni","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0552-8341","authenticated-orcid":false,"given":"Sergey","family":"Kandiy","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3678-9229","authenticated-orcid":false,"given":"Michal","family":"Gregus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,2,17]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press (2018). https:\/\/doi.org\/10.1201\/9780429466335","DOI":"10.1201\/9780429466335"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Rubinstein-Salzedo, S.: Cryptography. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94818-8","DOI":"10.1007\/978-3-319-94818-8"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Freyre Echevarr\u00eda, A.: Evoluci\u00f3n h\u00edbrida de s-cajas no lineales resistentes a ataques de potencia (2020). https:\/\/doi.org\/10.13140\/RG.2.2.17037.77284\/1","DOI":"10.13140\/RG.2.2.17037.77284\/1"},{"key":"10_CR4","unstructured":"McLaughlin, J.: Applications of search techniques to cryptanalysis and the construction of cipher components (2012). https:\/\/etheses.whiterose.ac.uk\/3674\/"},{"key":"10_CR5","doi-asserted-by":"publisher","unstructured":"\u00c1lvarez-Cubero, J.: Vector Boolean Functions: applications in symmetric cryptography (2015). https:\/\/doi.org\/10.13140\/RG.2.2.12540.23685","DOI":"10.13140\/RG.2.2.12540.23685"},{"key":"10_CR6","unstructured":"Carlet, C.: Vectorial Boolean functions for cryptography. Boolean Models and Methods in Mathematics, Computer Science, and Engineering (2006)"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Vijayakumar, M., Ahilan, A.: An optimized chaotic S-box for real-time image encryption scheme based on 4-dimensional memristive hyperchaotic map. Ain Shams Eng. J., 102620 (2024). https:\/\/doi.org\/10.1016\/j.asej.2023.102620","DOI":"10.1016\/j.asej.2023.102620"},{"key":"10_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jiixd.2024.01.005","author":"Y Ji","year":"2024","unstructured":"Ji, Y., Ma, Z., Li, L., Sun, Y.: Constructions of correlation immune S-boxes with high nonlinearity. J. Inf. Intell. (2024). https:\/\/doi.org\/10.1016\/j.jiixd.2024.01.005","journal-title":"J. Inf. Intell."},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Jamal, S.S., Hazzazi, M.M., Khan, M.F., Bassfar, Z., Aljaedi, A., ul Islam, Z.: Region of interest-based medical image encryption technique based on chaotic S-boxes. Expert Syst. Appl. 238, 122030 (2024). https:\/\/doi.org\/10.1016\/j.eswa.2023.122030","DOI":"10.1016\/j.eswa.2023.122030"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s12095-015-0170-5","volume":"8","author":"G Ivanov","year":"2016","unstructured":"Ivanov, G., Nikolov, N., Nikova, S.: Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties. Cryptogr. Commun. 8, 247\u2013276 (2016). https:\/\/doi.org\/10.1007\/s12095-015-0170-5","journal-title":"Cryptogr. Commun."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"1896","DOI":"10.3390\/sym12111896","volume":"12","author":"A Freyre-Echevarr\u00eda","year":"2020","unstructured":"Freyre-Echevarr\u00eda, A., et al.: An External parameter independent novel cost function for evolving bijective substitution-boxes. Symmetry 12, 1896 (2020). https:\/\/doi.org\/10.3390\/sym12111896","journal-title":"Symmetry"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"116132","DOI":"10.1109\/ACCESS.2020.3004449","volume":"8","author":"M Ahmad","year":"2020","unstructured":"Ahmad, M., Khaja, I.A., Baz, A., Alhakami, H., Alhakami, W.: Particle swarm optimization based highly nonlinear substitution-boxes generation for security applications. IEEE Access 8, 116132\u2013116147 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3004449","journal-title":"IEEE Access"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"15999","DOI":"10.1109\/ACCESS.2019.2893176","volume":"7","author":"MF Khan","year":"2019","unstructured":"Khan, M.F., Ahmed, A., Saleem, K.: A novel cryptographic substitution box design using Gaussian distribution. IEEE Access 7, 15999\u201316007 (2019). https:\/\/doi.org\/10.1109\/ACCESS.2019.2893176","journal-title":"IEEE Access"},{"key":"10_CR14","unstructured":"Lisitskiy, K., Lisitska, I., Kuznetsov, A.: Cryptographically properties of random S-boxes. In: Sokolov O., et al. (eds.) CEUR Workshop Proceedings, pp. 228\u2013241. CEUR-WS (2020)"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1515\/tmmp-2017-0020","volume":"70","author":"M Rodinko","year":"2017","unstructured":"Rodinko, M., Oliynykov, R., Gorbenko, Y.: Optimization of the high nonlinear s-boxes generation method. Tatra Mt. Math. Publ. 70, 93\u2013105 (2017). https:\/\/doi.org\/10.1515\/tmmp-2017-0020","journal-title":"Tatra Mt. Math. Publ."},{"key":"10_CR16","doi-asserted-by":"publisher","unstructured":"Alhadawi, H.S., Salih, S.Q., Salman, Y.D.: Chaotic particle swarm optimization based on meeting room approach for designing bijective S-boxes. In: Al-Emran, M., Al-Sharafi, M.A., Al-Kabi, M.N., Shaalan, K. (eds.) ICETIS 2021. LNNS, vol. 322, pp. 331\u2013341. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-030-85990-9_28","DOI":"10.1007\/978-3-030-85990-9_28"},{"key":"10_CR17","doi-asserted-by":"publisher","unstructured":"Lawah, A.I., Ibrahim, A.A., Salih, S.Q., Alhadawi, H.S., JosephNg, P.S.: Grey wolf optimizer and discrete chaotic map for substitution boxes design and optimization. IEEE Access, 1 (2023). https:\/\/doi.org\/10.1109\/ACCESS.2023.3266290","DOI":"10.1109\/ACCESS.2023.3266290"},{"key":"10_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/JPHOT.2022.3233129","volume":"15","author":"H Wen","year":"2023","unstructured":"Wen, H., et al.: Secure optical image communication using double random transformation and memristive chaos. IEEE Photonics J. 15, 1\u201311 (2023). https:\/\/doi.org\/10.1109\/JPHOT.2022.3233129","journal-title":"IEEE Photonics J."},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"4051","DOI":"10.1007\/s00521-022-07899-7","volume":"35","author":"KZ Zamli","year":"2023","unstructured":"Zamli, K.Z., Alhadawi, H.S., Din, F.: Utilizing the roulette wheel based social network search algorithm for substitution box construction and optimization. Neural Comput. Applic. 35, 4051\u20134071 (2023). https:\/\/doi.org\/10.1007\/s00521-022-07899-7","journal-title":"Neural Comput. Applic."},{"key":"10_CR20","doi-asserted-by":"publisher","unstructured":"Banzhaf, W., Hu, T.: Evolutionary computation. In: Evolutionary Biology. Oxford University Press (2019). https:\/\/doi.org\/10.1093\/obo\/9780199941728-0122","DOI":"10.1093\/obo\/9780199941728-0122"},{"key":"10_CR21","doi-asserted-by":"publisher","unstructured":"\u00c7ataloluk, H., \u00c7eleb\u0131, F.V.: A heuristic algorithm for Chan-Vese model. In: 2018 26th Signal Processing and Communications Applications Conference (SIU), pp. 1\u20134 (2018). https:\/\/doi.org\/10.1109\/SIU.2018.8404820","DOI":"10.1109\/SIU.2018.8404820"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Tun\u00e7, A., Ta\u015fdemir, \u015e., Sa\u011f, T.: Comparison of heuristic and metaheuristic algorithms. In: 2022 7th International Conference on Computer Science and Engineering (UBMK), pp. 76\u201381 (2022). https:\/\/doi.org\/10.1109\/UBMK55850.2022.9919459","DOI":"10.1109\/UBMK55850.2022.9919459"},{"key":"10_CR23","unstructured":"Freyre Echevarr\u00eda, A., Mart\u00ednez D\u00edaz, I.: A new cost function to improve nonlinearity of bijective S-boxes (2020)"},{"key":"10_CR24","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, 695\u2013718 (2016). https:\/\/doi.org\/10.1162\/EVCO_a_00191","journal-title":"Evol. Comput."},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF03037656","volume":"23","author":"JA Clark","year":"2005","unstructured":"Clark, J.A., Jacob, J.L., Stepney, S.: The design of S-boxes by simulated annealing. New Gener. Comput. 23, 219\u2013231 (2005). https:\/\/doi.org\/10.1007\/BF03037656","journal-title":"New Gener. Comput."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-84356-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T13:46:56Z","timestamp":1740491216000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-84356-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031843556","9783031843563"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-84356-3_10","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":"17 February 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"ICAISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence and Soft Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zakopane","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","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":"16 June 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 June 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaisc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icaisc.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}