{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T04:13:02Z","timestamp":1769573582241,"version":"3.49.0"},"reference-count":49,"publisher":"MDPI AG","issue":"3","license":[{"start":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T00:00:00Z","timestamp":1678665600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100005357","name":"Slovak Research and Development Agency","doi-asserted-by":"publisher","award":["APVV-19-0220"],"award-info":[{"award-number":["APVV-19-0220"]}],"id":[{"id":"10.13039\/501100005357","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>Cryptographic S-boxes are vectorial Boolean functions that must fulfill strict criteria to provide security for cryptographic algorithms. There are several existing methods for generating strong cryptographic S-boxes, including stochastic search algorithms. These search algorithms typically generate random candidate Boolean functions (or permutations) that are improved during the search by examining the search space in a specific way. Here, we introduce a new type of stochastic algorithm for generating cryptographic S-boxes. We do not generate and then improve the Boolean function; instead, we build the vector of values incrementally. New values are obtained by randomized search driven by restrictions on the differential spectrum of the generated S-box. In this article, we formulate two new algorithms based on this new approach and study the better one in greater detail. We prove the correctness of the proposed algorithm and evaluate its complexity. The final part contains an experimental evaluation of the method. We show that the algorithm generates S-boxes with better properties than a random search. We believe that our approach can be extended in the future by adopting more advanced stochastic search methods.<\/jats:p>","DOI":"10.3390\/a16030157","type":"journal-article","created":{"date-parts":[[2023,3,13]],"date-time":"2023-03-13T04:35:41Z","timestamp":1678682141000},"page":"157","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Algorithm for Generating S-Boxes with Prescribed Differential Properties"],"prefix":"10.3390","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-9446-1871","authenticated-orcid":false,"given":"Stanislav","family":"Marochok","sequence":"first","affiliation":[{"name":"Department of Computer Science and Mathematics, Faculty of Electrical Engineering and Information Technology, Slovak University of Technology in Bratislava, Ilkovi\u010dova 3, 812 19 Bratislava, Slovakia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1909-9453","authenticated-orcid":false,"given":"Pavol","family":"Zajac","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Mathematics, Faculty of Electrical Engineering and Information Technology, Slovak University of Technology in Bratislava, Ilkovi\u010dova 3, 812 19 Bratislava, Slovakia"}]}],"member":"1968","published-online":{"date-parts":[[2023,3,13]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","article-title":"Communication theory of secrecy systems","volume":"28","author":"Shannon","year":"1949","journal-title":"Bell Syst. Tech. J."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Carlet, C. (2021). Boolean Functions for Cryptography and Coding Theory, Cambridge University Press.","DOI":"10.1017\/9781108606806"},{"key":"ref_3","unstructured":"Matsui, M. (1994). Proceedings of the Advances in Cryptology\u2014EUROCRYPT\u201993: Workshop on the Theory and Application of Cryptographic Techniques Lofthus, Norway, May 23\u201327, 1993 Proceedings 12, Springer."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF00630563","article-title":"Differential cryptanalysis of DES-like cryptosystems","volume":"4","author":"Biham","year":"1991","journal-title":"J. Cryptol."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1049\/ip-cdt:19981769","article-title":"Balanced boolean functions","volume":"145","author":"Chakrabarty","year":"1998","journal-title":"IEE Proc.-Comput. Digit. Tech."},{"key":"ref_6","unstructured":"Webster, A.F., and Tavares, S.E. (1985). Proceedings of the Advances in Cryptology\u2014CRYPTO\u201985 Proceedings, Springer."},{"key":"ref_7","unstructured":"Forri\u00e9, R. (1988, January 21\u201325). The strict avalanche criterion: Spectral properties of Boolean functions and an extended definition. Proceedings of the Conference on the Theory and Application of Cryptography, Santa Barbara, CA, USA."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Maitra, S., Veni Madhavan, C.E., and Venkatesan, R. On the Algebraic Immunity of Symmetric Boolean Functions. Proceedings of the Progress in Cryptology\u2014INDOCRYPT 2005.","DOI":"10.1007\/11596219"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s12095-014-0100-y","article-title":"Multiplicative complexity of bijective 4\u00d7 4 S-boxes","volume":"6","author":"Zajac","year":"2014","journal-title":"Cryptogr. Commun."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1007\/s12095-020-00447-x","article-title":"Cryptographic properties of small bijective S-boxes with respect to modular addition","volume":"12","author":"Zajac","year":"2020","journal-title":"Cryptogr. Commun."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Matheis, K., Steinwandt, R., and Su\u00e1rez Corona, A. (2019). Algebraic Properties of the Block Cipher DESL. Symmetry, 11.","DOI":"10.3390\/sym11111411"},{"key":"ref_12","first-page":"80","article-title":"MARS-a candidate cipher for AES","volume":"268","author":"Burwick","year":"1998","journal-title":"NIST AES Propos."},{"key":"ref_13","first-page":"179","article-title":"Evolutionary computation in cryptanalysis of classical ciphers","volume":"70","author":"Antal","year":"2017","journal-title":"Tatra Mt. Math. Publ."},{"key":"ref_14","unstructured":"Mariot, L., Jakobovic, D., B\u00e4ck, T., and Hernandez-Castro, J. (2022). Security and Artificial Intelligence: A Crossdisciplinary Approach, Springer."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Clark, J.A., and Jacob, J.L. (2000, January 10\u201312). Two-stage optimisation in the design of Boolean functions. Proceedings of the Australasian Conference on Information Security and Privacy, Brisbane, QLD, Australia.","DOI":"10.1007\/10718964_20"},{"key":"ref_16","unstructured":"Millan, W., Clark, A., and Dawson, E. (1997, January 11\u201312). Smart hill climbing finds better boolean functions. Proceedings of the Workshop on Selected Areas in Cryptology, Ottawa, ON, Canada."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Millan, W., Burnett, L., Carter, G., Clark, A., and Dawson, E. (June, January 31). Evolutionary heuristics for finding cryptographically strong S-boxes. Proceedings of the International Conference on Information and Communications Security, EUROCRYPT 1998, Espoo, Finland.","DOI":"10.1007\/978-3-540-47942-0_22"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF03037655","article-title":"Multi-objective optimisation of bijective S-boxes","volume":"23","author":"Fuller","year":"2005","journal-title":"New Gener. Comput."},{"key":"ref_19","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_20","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_21","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_22","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s12095-015-0170-5","article-title":"Reversed genetic algorithms for generation of bijective s-boxes with good cryptographic properties","volume":"8","author":"Ivanov","year":"2016","journal-title":"Cryptogr. Commun."},{"key":"ref_23","doi-asserted-by":"crossref","unstructured":"Picek, S., Mariot, L., Yang, B., Jakobovic, D., and Mentens, N. (2017, January 15\u201317). Design of S-boxes defined with cellular automata rules. Proceedings of the Computing Frontiers Conference, Siena, Italy.","DOI":"10.1145\/3075564.3079069"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s12095-018-0311-8","article-title":"Cellular automata based S-boxes","volume":"11","author":"Mariot","year":"2019","journal-title":"Cryptogr. Commun."},{"key":"ref_25","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_26","first-page":"23","article-title":"A new method for generating high non-linearity s-boxes","volume":"19","year":"2010","journal-title":"Radioengineering"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1109\/TIT.1968.1054106","article-title":"Maximal recursive sequences with 3-valued recursive cross-correlation functions (Corresp.)","volume":"14","author":"Gold","year":"1968","journal-title":"IEEE Trans. Inf. Theory"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1016\/S0019-9958(71)90473-6","article-title":"The weight enumerators for several classes of subcodes of the 2nd order binary Reed-Muller codes","volume":"18","author":"Kasami","year":"1971","journal-title":"Inf. Control"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.ffa.2010.03.001","article-title":"A highly nonlinear differentially 4 uniform power mapping that permutes fields of even degree","volume":"16","author":"Bracken","year":"2010","journal-title":"Finite Fields Their Appl."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1090\/conm\/518\/10194","article-title":"An APN permutation in dimension six","volume":"518","author":"Browning","year":"2010","journal-title":"Finite Fields Theory Appl."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10623-020-00807-x","article-title":"Differentially low uniform permutations from known 4-uniform functions","volume":"89","author":"Calderini","year":"2021","journal-title":"Des. Codes Cryptogr."},{"key":"ref_32","unstructured":"Nyberg, K. (1991, January 8\u201311). Perfect nonlinear S-boxes. Proceedings of the Workshop on the Theory and Application of Cryptographic Techniques, Brighton, UK."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Zahid, A.H., and Arshad, M.J. (2019). An Innovative Design of Substitution-Boxes Using Cubic Polynomial Mapping. Symmetry, 11.","DOI":"10.3390\/sym11030437"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Juremi, J., Mahmod, R., and Sulaiman, S. (2012, January 26\u201328). A proposal for improving AES S-box with rotation and key-dependent. Proceedings of the 2012 International Conference on Cyber Security, Cyber Warfare and Digital Forensic (CyberSec), Kuala Lumpur, Malaysia.","DOI":"10.1109\/CyberSec.2012.6246172"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Sahoo, O., Kole, D., and Rahaman, H. (2012, January 9\u201311). An Optimized S-Box for Advanced Encryption Standard (AES) Design. Proceedings of the 2012 International Conference on Advances in Computing and Communications, Cochin, India.","DOI":"10.1109\/ICACC.2012.35"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Wang, H., Zheng, H., Hu, B., and Tang, H. (2013, January 21\u201323). Improved Lightweight Encryption Algorithm Based on Optimized S-Box. Proceedings of the 2013 International Conference on Computational and Information Sciences, Shiyang, China.","DOI":"10.1109\/ICCIS.2013.198"},{"key":"ref_37","first-page":"2291","article-title":"An improved AES S-box and its performance analysis","volume":"7","author":"Cui","year":"2011","journal-title":"Int. J. Innov. Comput. Inf. Control"},{"key":"ref_38","doi-asserted-by":"crossref","unstructured":"Niemiec, M., and Machowski, L. (2012, January 3\u20135). A new symmetric block cipher based on key-dependent S-boxes. Proceedings of the 2012 IV International Congress on Ultra Modern Telecommunications and Control Systems, St. Petersburg, Russia.","DOI":"10.1109\/ICUMT.2012.6459712"},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Kazlauskas, K., Smaliukas, R., and Vaicekauskas, G. (2016). A Novel Method to Design S-Boxes Based on Key-Dependent Permutation Schemes and its Quality Analysis. Int. J. Adv. Comput. Sci. Appl., 7.","DOI":"10.14569\/IJACSA.2016.070412"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"51","DOI":"10.15388\/Informatica.2015.38","article-title":"An Algorithm for Key-Dependent S-Box Generation in Block Cipher System","volume":"26","author":"Kazlauskas","year":"2015","journal-title":"Informatica"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1016\/j.procs.2016.03.131","article-title":"AES Based Text Encryption Using 12 Rounds with Dynamic Key Selection","volume":"79","author":"Mathur","year":"2016","journal-title":"Procedia Comput. Sci."},{"key":"ref_42","first-page":"2946","article-title":"Introducing a new method in cryptography by using dynamic P-Box and S-Box (DPS method) based on modular calculation and key encryption","volume":"12","author":"Zobeiri","year":"2017","journal-title":"ARPN J. Eng. Appl. Sci."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Gupta, M., and Sinha, A. (2021). Enhanced-AES encryption mechanism with S-box splitting for wireless sensor networks. Int. J. Inf. Technol., 13.","DOI":"10.1007\/s41870-021-00626-w"},{"key":"ref_44","unstructured":"Gro\u0161ek, O., Nemoga, K., and Satko, L. (2022, December 14). Ideal Difference Tables from an Algebraic Point of View. Cryptology and Information Security, Proc. of VI RECSI, Teneriffe, Spain 2000; pp. 51\u201358. Ammendment to Criptologia y Seguridad de la Informacion (P. Caballero-Gil, C. Hern\u00b4andez-Goya), RA-MA, Madrid. 2000. pp. 453\u2013454. Available online: https:\/\/www.casadellibro.com\/libro-criptologia-y-seguridad-de-la-informacion-vi-recsi-actas\/9788478974313\/727589."},{"key":"ref_45","first-page":"85","article-title":"Extremal generalized S-boxes","volume":"22","author":"Satko","year":"2003","journal-title":"Comput. Inform."},{"key":"ref_46","first-page":"135","article-title":"Constructing S-boxes with low multiplicative complexity","volume":"52","author":"Zajac","year":"2015","journal-title":"Stud. Sci. Math. Hung."},{"key":"ref_47","unstructured":"Bogdanov, A., Knudsen, L.R., Leander, G., Paar, C., Poschmann, A., Robshaw, M.J., Seurin, Y., and Vikkelsoe, C. (2007, January 10\u201313). PRESENT: An ultra-lightweight block cipher. Proceedings of the International Workshop on Cryptographic Hardware and Embedded Systems, Vienna, Austria."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1080\/00029890.1990.11995666","article-title":"A New Derivation of Stirling\u2019s Approximation to n!","volume":"97","author":"Marsaglia","year":"1990","journal-title":"Am. Math. Mon."},{"key":"ref_49","unstructured":"Marochok, S. (2021). Constructing S-Boxes with Prescribed Differential Distribution Table. [Master\u2019s Thesis, Slovak University of Technology in Bratislava]."}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/3\/157\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T18:53:38Z","timestamp":1760122418000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/16\/3\/157"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,13]]},"references-count":49,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2023,3]]}},"alternative-id":["a16030157"],"URL":"https:\/\/doi.org\/10.3390\/a16030157","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,13]]}}}