{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T03:36:53Z","timestamp":1764733013985,"version":"build-2065373602"},"reference-count":38,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"the National Centre for Research and Development, Poland","award":["POIR.04.01.04-00-0048\/20"],"award-info":[{"award-number":["POIR.04.01.04-00-0048\/20"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>The problem of nonlinear substitution generation (S-boxes) is investigated in many related works in symmetric key cryptography. In particular, the strength of symmetric ciphers to linear cryptanalysis is directly related to the nonlinearity of substitution. In addition to being highly nonlinear, S-boxes must be random, i.e., must not contain hidden mathematical constructs that facilitate algebraic cryptanalysis. The generation of such substitutions is a complex combinatorial optimization problem. Probabilistic algorithms are used to solve it, for instance the simulated annealing algorithm, which is well-fitted to a discrete search space. We propose a new cost function based on Walsh\u2013Hadamard spectrum computation, and investigate the search efficiency of S-boxes using a simulated annealing algorithm. For this purpose, we conduct numerous experiments with different input parameters: initial temperature, cooling coefficient, number of internal and external loops. As the results of the research show, applying the new cost function allows for the rapid generation of nonlinear substitutions. To find 8-bit bijective S-boxes with nonlinearity 104, we need about 83,000 iterations. At the same time, the probability of finding the target result is 100%.<\/jats:p>","DOI":"10.3390\/info14050259","type":"journal-article","created":{"date-parts":[[2023,4,27]],"date-time":"2023-04-27T02:18:34Z","timestamp":1682561914000},"page":"259","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Generation of Nonlinear Substitutions by Simulated Annealing Algorithm"],"prefix":"10.3390","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2331-6326","authenticated-orcid":false,"given":"Alexandr","family":"Kuznetsov","sequence":"first","affiliation":[{"name":"Department of Political Sciences, Communication and International Relations, University of Macerata, Via Crescimbeni, 30\/32, 62100 Macerata, Italy"},{"name":"Department of Information and Communication Systems Security, Faculty of Comupter Science, V. N. Karazin Kharkiv National University, 4 Svobody Sq., 61022 Kharkiv, Ukraine"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8846-332X","authenticated-orcid":false,"given":"Mikolaj","family":"Karpinski","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Automatics, University of Bielsko-Biala, 2 Willowa St., 43309 Bielsko-Biala, Poland"},{"name":"Cyber Security Department, Ternopil Ivan Puluj National Technical University, 56 Ruska St., 46001 Ternopil, Ukraine"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8654-6981","authenticated-orcid":false,"given":"Ruslana","family":"Ziubina","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Automatics, University of Bielsko-Biala, 2 Willowa St., 43309 Bielsko-Biala, Poland"}]},{"given":"Sergey","family":"Kandiy","sequence":"additional","affiliation":[{"name":"Department of Information and Communication Systems Security, Faculty of Comupter Science, V. N. Karazin Kharkiv National University, 4 Svobody Sq., 61022 Kharkiv, Ukraine"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8893-9244","authenticated-orcid":false,"given":"Emanuele","family":"Frontoni","sequence":"additional","affiliation":[{"name":"Department of Political Sciences, Communication and International Relations, University of Macerata, Via Crescimbeni, 30\/32, 62100 Macerata, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0507-0262","authenticated-orcid":false,"given":"Oleksandr","family":"Peliukh","sequence":"additional","affiliation":[{"name":"Department of Information and Communication Systems Security, Faculty of Comupter Science, V. N. Karazin Kharkiv National University, 4 Svobody Sq., 61022 Kharkiv, Ukraine"}]},{"given":"Olga","family":"Veselska","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Automatics, University of Bielsko-Biala, 2 Willowa St., 43309 Bielsko-Biala, Poland"}]},{"given":"Ruslan","family":"Kozak","sequence":"additional","affiliation":[{"name":"Cyber Security Department, Ternopil Ivan Puluj National Technical University, 56 Ruska St., 46001 Ternopil, Ukraine"}]}],"member":"1968","published-online":{"date-parts":[[2023,4,26]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Menezes, A.J., van Oorschot, P.C., Vanstone, S.A., van Oorschot, P.C., and Vanstone, S.A. (2018). Handbook of Applied Cryptography, CRC Press.","DOI":"10.1201\/9781439821916"},{"key":"ref_2","unstructured":"Schneier, B. (1996). Applied Cryptography: Protocols, Algorithms, and Source Code in C, Wiley."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Kuznetsov, A.A., Potii, O.V., Poluyanenko, N.A., Gorbenko, Y.I., and Kryvinska, N. (2022). Stream Ciphers in Modern Real-Time IT Systems, Springer Nature. Studies in Systems, Decision and Control.","DOI":"10.1007\/978-3-030-79770-6"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/j.ffa.2005.07.003","article-title":"Nonlinearities of S-Boxes","volume":"13","author":"Carlet","year":"2007","journal-title":"Finite Fields Appl."},{"key":"ref_5","unstructured":"Carlet, C. (2006). Boolean Models and Methods in Mathematics, Computer Science, and Engineering, Cambrige University Press."},{"key":"ref_6","unstructured":"Helleseth, T. (1994). Advances in Cryptology, Proceedings of the EUROCRYPT \u201993: Workshop on the Theory and Application of Cryptographic Techniques Lofthus, Norway, 23\u201327 May 1993, Springer."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Mihailescu, M.I., and Nita, S.L. (2021). Pro Cryptography and Cryptanalysis: Creating Advanced Algorithms with C# and .NET, Apress.","DOI":"10.1007\/978-1-4842-6367-9"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.46586\/tosc.v2018.i3.215-264","article-title":"Conditional Linear Cryptanalysis\u2014Cryptanalysis of DES with Less Than 242 Complexity","volume":"3","author":"Biham","year":"2018","journal-title":"IACR Trans. Symmetric Cryptol."},{"key":"ref_9","unstructured":"Freyre Echevarr\u00eda, A. (2020). Evoluci\u00f3n H\u00edbrida de S-Cajas No Lineales Resistentes a Ataques de Potencia. [Master\u2019s Thesis, Universidad de La Habana]."},{"key":"ref_10","unstructured":"\u00c1lvarez-Cubero, J. (2015). Vector Boolean Functions: Applications in Symmetric Cryptography. [Ph.D. Thesis, Universidad Polit\u00e9cnica de Madrid]."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1162\/EVCO_a_00191","article-title":"A New Cost Function for Evolution of S-Boxes","volume":"24","author":"Picek","year":"2016","journal-title":"Evol. Comput."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"202728","DOI":"10.1109\/ACCESS.2020.3035163","article-title":"Evolving Nonlinear S-Boxes with Improved Theoretical Resilience to Power Attacks","volume":"8","author":"Rojas","year":"2020","journal-title":"IEEE Access"},{"key":"ref_13","unstructured":"Ars, G., and Faug\u00e8re, J.-C. (2005). Algebraic Immunities of Functions over Finite Fields, INRIA."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Galbraith, S.D. (2007). Cryptography and Coding, Proceedings of the 11th IMA International Conference, Cirencester, UK, 18\u201320 December 2007, Springer.","DOI":"10.1007\/978-3-540-77272-9"},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Bard, G.V. (2009). Algebraic Cryptanalysis, Springer.","DOI":"10.1007\/978-0-387-88757-9"},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Daemen, J., and Rijmen, V. (2020). The Design of Rijndael: The Advanced Encryption Standard (AES), Information Security and Cryptography; Springer.","DOI":"10.1007\/978-3-662-60769-5"},{"key":"ref_17","unstructured":"Zheng, Y. (2002). Advances in Cryptology, Proceedings of the ASIACRYPT 2002: 8th International Conference on the Theory and Application of Cryptology and Information Security Queenstown, New Zealand, 1\u20135 December 2002, Springer."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Gorbenko, I., Kuznetsov, A., Gorbenko, Y., Pushkar\u2019ov, A., Kotukh, Y., and Kuznetsova, K. (2019, January 2\u20136). Random S-Boxes Generation Methods for Symmetric Cryptography. Proceedings of the 2019 IEEE 2nd Ukraine Conference on Electrical and Computer Engineering (UKRCON), Lviv, Ukraine.","DOI":"10.1109\/UKRCON.2019.8879962"},{"key":"ref_19","unstructured":"Clark, A.J. (1998). Optimisation Heuristics for Cryptology. [Ph.D. Thesis, Queensland University of Technology]."},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Boyd, C., and Dawson, E. (1998). Information Security and Privacy, Proceedings of the Third Australasian Conference, ACISP\u201998, Brisbane, Australia, 13\u201315 July 1998, Springer.","DOI":"10.1007\/BFb0053715"},{"key":"ref_21","unstructured":"Clark, J.A., Jacob, J.L., and Stepney, S. (2004, January 19\u201323). The Design of S-Boxes by Simulated Annealing. Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), Portland, OR, USA."},{"key":"ref_22","unstructured":"Burnett, L.D. (2005). Heuristic Optimization of Boolean Functions and Substitution Boxes for Cryptography. [Ph.D. Thesis, Queensland University of Technology]."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-319-91086-4_1","article-title":"Simulated Annealing: From Basics to Applications","volume":"Volume 272","author":"Potvin","year":"2019","journal-title":"Handbook of Metaheuristics"},{"key":"ref_24","unstructured":"McLaughlin, J., and Clark, J.A. (2013). Using Evolutionary Computation to Create Vectorial Boolean Functions with Low Differential Uniformity and High Nonlinearity. arXiv."},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Kuznetsov, A., Wieclaw, L., Poluyanenko, N., Hamera, L., Kandiy, S., and Lohachova, Y. (2022). Optimization of a Simulated Annealing Algorithm for S-Boxes Generating. Sensors, 22.","DOI":"10.3390\/s22166073"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Freyre Echevarr\u00eda, A., and Mart\u00ednez D\u00edaz, I. (2020). A New Cost Function to Improve Nonlinearity of Bijective S-Boxes. Symmetry, 12.","DOI":"10.3390\/sym12111896"},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Kuznetsov, A., Poluyanenko, N., Kandii, S., Zaichenko, Y., Prokopovich-Tkachenko, D., and Katkova, T. (2021, January 5\u20137). Optimizing the Local Search Algorithm for Generating S-Boxes. Proceedings of the 2021 IEEE 8th International Conference on Problems of Infocommunications, Science and Technology (PIC S T), Kharkiv, Ukraine.","DOI":"10.1109\/PICST54195.2021.9772163"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Freyre-Echevarr\u00eda, A., Alanezi, A., Mart\u00ednez-D\u00edaz, I., Ahmad, M., Abd El-Latif, A.A., Kolivand, H., and Razaq, A. (2020). An External Parameter Independent Novel Cost Function for Evolving Bijective Substitution-Boxes. Symmetry, 12.","DOI":"10.3390\/sym12111896"},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Pieprzyk, J., Safavi-Naini, R., and Seberry, J. (1999). Information Security and Privacy, Proceedings of the 4th Australasian Conference, ACISP\u201999 Wollongong, NSW, Australia, 7\u20139 April 1999, Springer.","DOI":"10.1007\/3-540-48970-3"},{"key":"ref_30","unstructured":"Millan, W., and Clark, A. (1997). Workshop on Selected Areas in Cryptology, Queensland University of Technology."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1016\/j.asoc.2017.05.052","article-title":"Designing Bijective S-Boxes Using Algorithm Portfolios with Limited Time Budgets","volume":"59","author":"Souravlias","year":"2017","journal-title":"Appl. Soft Comput."},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Wang, J., Zhu, Y., Zhou, C., and Qi, Z. (2020). Construction Method and Performance Analysis of Chaotic S-Box Based on a Memorable Simulated Annealing Algorithm. Symmetry, 12.","DOI":"10.3390\/sym12122115"},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Friedli, S., and Velenik, Y. (2017). Statistical Mechanics of Lattice Systems: A Concrete Mathematical Introduction, Cambridge University Press. [1st ed.].","DOI":"10.1017\/9781316882603"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Eremia, M., Liu, C.-C., and Edris, A.-A. (2016). Advanced Solutions in Power Systems: HVDC, FACTS, and Artificial Intelligence, IEEE.","DOI":"10.1002\/9781119175391"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Laskari, E.C., Meletiou, G.C., and Vrahatis, M.N. (2006, January 3\u20136). Utilizing Evolutionary Computation Methods for the Design of S-Boxes. Proceedings of the 2006 International Conference on Computational Intelligence and Security, Guangzhou, China.","DOI":"10.1109\/ICCIAS.2006.295267"},{"key":"ref_36","first-page":"23","article-title":"A New Method for Generating High Non-Linearity S-Boxes","volume":"19","author":"Tesar","year":"2010","journal-title":"Radioengineering"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Eiben, A.E., and Smith, J.E. (2003). Introduction to Evolutionary Computing, Springer.","DOI":"10.1007\/978-3-662-05094-1"},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Pasalic, E., and Knudsen, L.R. (2016). Cryptography and Information Security in the Balkans, Proceedings of the Second International Conference, BalkanCryptSec 2015, Koper, Slovenia, 3-4 September 2015, Springer International Publishing.","DOI":"10.1007\/978-3-319-29172-7"}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/14\/5\/259\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T19:23:56Z","timestamp":1760124236000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/14\/5\/259"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,26]]},"references-count":38,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2023,5]]}},"alternative-id":["info14050259"],"URL":"https:\/\/doi.org\/10.3390\/info14050259","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2023,4,26]]}}}