{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T11:14:34Z","timestamp":1777634074121,"version":"3.51.4"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"22","license":[{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s00521-022-07589-4","type":"journal-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T16:09:51Z","timestamp":1658246991000},"page":"20203-20211","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["SBOX-CGA: substitution box generator based on chaos and genetic algorithm"],"prefix":"10.1007","volume":"34","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4096-0458","authenticated-orcid":false,"given":"F\u0131rat","family":"Artu\u011fer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1292-8490","authenticated-orcid":false,"given":"Fatih","family":"\u00d6zkaynak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"7589_CR1","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1016\/j.ins.2021.07.036","volume":"576","author":"F Artu\u011fer","year":"2021","unstructured":"Artu\u011fer F, \u00d6zkaynak F (2021) An effective method to improve nonlinearity value of substitution boxes based on random selection. Inf Sci 576:577\u2013588","journal-title":"Inf Sci"},{"key":"7589_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/j.ins.2017.03.025","volume":"402","author":"Y Wei","year":"2017","unstructured":"Wei Y, Pasalic E, Zhang F, Hod\u017ei\u0107 S (2017) Efficient probabilistic algorithm for estimating the algebraic properties of Boolean functions for large n. Inf Sci 402:91\u2013104","journal-title":"Inf Sci"},{"key":"7589_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48865-2","volume-title":"Boolean functions and their applications in cryptography","author":"C Wu","year":"2016","unstructured":"Wu C, Feng D (2016) Boolean functions and their applications in cryptography. Springer, Berlin"},{"key":"7589_CR4","unstructured":"Daemen J, Rijmen V (1998) AES proposal: Rijndael. In: Proceedings of 1st advance encryption conference, CA, USA, pp 1\u201345"},{"key":"7589_CR5","volume-title":"Side-channel analysis attacks on hardware implementations of cryptographic algorithms, in Wireless Security and Cryptography-Specifications and Implementations","author":"SB Ors","year":"2007","unstructured":"Ors SB, Preneel B, Verbauwhede I (2007) Side-channel analysis attacks on hardware implementations of cryptographic algorithms, in Wireless Security and Cryptography-Specifications and Implementations. CRC Press, Boca Raton"},{"issue":"1","key":"7589_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.eij.2021.08.002","volume":"23","author":"F Artu\u011fer","year":"2022","unstructured":"Artu\u011fer F, \u00d6zkaynak F (2022) A method for generation of substitution box based on random selection. Egypt. Inform. J. 23(1):127\u2013135","journal-title":"Egypt. Inform. J."},{"key":"7589_CR7","doi-asserted-by":"crossref","unstructured":"Nyberg K (1994) Differentially uniform mappings for cryptography. In: Proceedings of Eurocrypt. Lecture notes in computer science, vol 765. Springer, Berlin, pp 55\u201364","DOI":"10.1007\/3-540-48285-7_6"},{"key":"7589_CR8","doi-asserted-by":"publisher","first-page":"1482","DOI":"10.1109\/ACCESS.2020.3046470","volume":"9","author":"M\u015e A\u00e7ikkapi","year":"2021","unstructured":"A\u00e7ikkapi M\u015e, \u00d6zkaynak F (2021) A method to determine the most suitable initial conditions of chaotic map in statistical randomness applications. IEEE Access 9:1482\u20131494","journal-title":"IEEE Access"},{"issue":"4","key":"7589_CR9","doi-asserted-by":"publisher","first-page":"1028","DOI":"10.1016\/j.chaos.2006.08.003","volume":"36","author":"G Chen","year":"2008","unstructured":"Chen G (2008) A novel heuristic method for obtaining S-boxes. Chaos Solitons Fractals 36(4):1028\u20131036","journal-title":"Chaos Solitons Fractals"},{"issue":"1","key":"7589_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s00521-012-0914-5","volume":"23","author":"I Hussain","year":"2013","unstructured":"Hussain I, Shah T, Gondal MA, Khan WA, Mahmood H (2013) A group theoretic approach to construct cryptographically strong substitution boxes. Neural Comput Appl 23(1):97\u2013104","journal-title":"Neural Comput Appl"},{"issue":"2","key":"7589_CR11","doi-asserted-by":"publisher","first-page":"1059","DOI":"10.1007\/s11071-016-3295-y","volume":"88","author":"T Farah","year":"2017","unstructured":"Farah T, Rhouma R, Belghith S (2017) A novel method for designing S-box based on chaotic map and teaching\u2013learning-based optimization. Nonlinear Dyn 88(2):1059\u20131074","journal-title":"Nonlinear Dyn"},{"issue":"10","key":"7589_CR12","doi-asserted-by":"publisher","first-page":"5111","DOI":"10.1007\/s00521-020-05304-9","volume":"33","author":"N Hematpour","year":"2021","unstructured":"Hematpour N, Ahadpour S (2021) Execution examination of chaotic S-box dependent on improved PSO algorithm. Neural Comput Appl 33(10):5111\u20135133","journal-title":"Neural Comput Appl"},{"key":"7589_CR13","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1016\/j.procs.2015.07.394","volume":"57","author":"M Ahmad","year":"2015","unstructured":"Ahmad M, Bhatia D, Hassan Y (2015) A novel ant colony optimization based scheme for substitution box design. Procedia Comput Sci 57:572\u2013580","journal-title":"Procedia Comput Sci"},{"key":"7589_CR14","volume":"55","author":"HS Alhadawi","year":"2020","unstructured":"Alhadawi HS, Lambi\u0107 D, Zolkipli MF, Ahmad M (2020) Globalized firefly algorithm and chaos for designing substitution box. J Inf Secur Appl 55:102671","journal-title":"J Inf Secur Appl"},{"issue":"11","key":"7589_CR15","doi-asserted-by":"publisher","first-page":"7201","DOI":"10.1007\/s00521-018-3557-3","volume":"31","author":"HA Ahmed","year":"2019","unstructured":"Ahmed HA, Zolkipli MF, Ahmad M (2019) A novel efficient substitution-box design based on firefly algorithm and discrete chaotic map. Neural Comput Appl 31(11):7201\u20137210","journal-title":"Neural Comput Appl"},{"key":"7589_CR16","doi-asserted-by":"publisher","DOI":"10.1155\/2017\/6969312","volume":"2017","author":"Y Tian","year":"2017","unstructured":"Tian Y, Lu Z (2017) Chaotic S-box: intertwining logistic map and bacterial foraging optimization. Math Problems Eng 2017:6969312","journal-title":"Math Problems Eng"},{"issue":"6\u20137","key":"7589_CR17","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1016\/j.physleta.2012.01.009","volume":"376","author":"Y Wang","year":"2012","unstructured":"Wang Y, Wong KW, Li C, Li Y (2012) A novel method to design S-box based on chaotic map and genetic algorithm. Phys Lett A 376(6\u20137):827\u2013833","journal-title":"Phys Lett A"},{"issue":"5","key":"7589_CR18","doi-asserted-by":"publisher","first-page":"7333","DOI":"10.1007\/s11042-020-10048-8","volume":"80","author":"HS Alhadawi","year":"2021","unstructured":"Alhadawi HS, Majid MA, Lambi\u0107 D, Ahmad M (2021) A novel method of S-box design based on discrete chaotic maps and cuckoo search algorithm. Multimed Tools Appl 80(5):7333\u20137350","journal-title":"Multimed Tools Appl"},{"key":"7589_CR19","doi-asserted-by":"publisher","first-page":"16641","DOI":"10.1007\/s00521-021-06260-8","volume":"33","author":"KZ Zamli","year":"2021","unstructured":"Zamli KZ, Kader A, Din F, Alhadawi HS (2021) Selective chaotic maps Tiki-Taka algorithm for the S-box generation and optimization. Neural Comput Appl 33:16641\u201316658","journal-title":"Neural Comput Appl"},{"key":"7589_CR20","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115305","volume":"182","author":"KZ Zamli","year":"2021","unstructured":"Zamli KZ (2021) Optimizing S-box generation based on the adaptive agent heroes and cowards algorithm. Expert Syst Appl 182:115305","journal-title":"Expert Syst Appl"},{"key":"7589_CR21","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1016\/j.ins.2020.03.025","volume":"523","author":"Y Wang","year":"2020","unstructured":"Wang Y, Zhang Z, Zhang LY, Feng J, Gao J, Lei P (2020) A genetic algorithm for constructing bijective substitution boxes with high nonlinearity. Inf Sci 523:152\u2013166","journal-title":"Inf Sci"},{"issue":"4","key":"7589_CR22","doi-asserted-by":"publisher","first-page":"1715","DOI":"10.1016\/j.chaos.2007.09.063","volume":"40","author":"B Alatas","year":"2009","unstructured":"Alatas B, Akin E, Ozer AB (2009) Chaos embedded particle swarm optimization algorithms. Chaos Solitons Fractals 40(4):1715\u20131734","journal-title":"Chaos Solitons Fractals"},{"key":"7589_CR23","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2019.124072","volume":"550","author":"F \u00d6zkaynak","year":"2020","unstructured":"\u00d6zkaynak F (2020) On the effect of chaotic system in performance characteristics of chaos based S-box designs. Phys. A Stat. Mech. Appl. 550:124072. https:\/\/doi.org\/10.1016\/j.physa.2019.124072","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"7589_CR24","doi-asserted-by":"publisher","DOI":"10.1142\/7183","volume-title":"Elegant chaos algebraically simple chaotic flows","author":"J Sprott","year":"2010","unstructured":"Sprott J (2010) Elegant chaos algebraically simple chaotic flows. World Scientific, Singapore"},{"issue":"4","key":"7589_CR25","doi-asserted-by":"publisher","first-page":"571","DOI":"10.3390\/sym12040571","volume":"12","author":"F Artu\u011fer","year":"2020","unstructured":"Artu\u011fer F, \u00d6zkaynak F (2020) A novel method for performance improvement of chaos-based substitution boxes. Symmetry 12(4):571","journal-title":"Symmetry"},{"issue":"1","key":"7589_CR26","doi-asserted-by":"publisher","first-page":"129","DOI":"10.3390\/sym13010129","volume":"13","author":"BM Alshammari","year":"2021","unstructured":"Alshammari BM, Guesmi R, Guesmi T, Alsaif H, Alzamil A (2021) Implementing a symmetric lightweight cryptosystem in highly constrained IoT devices by using a chaotic S-box. Symmetry 13(1):129","journal-title":"Symmetry"},{"key":"7589_CR27","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1016\/j.ins.2020.09.055","volume":"547","author":"Y Xian","year":"2021","unstructured":"Xian Y, Wang X (2021) Fractal sorting matrix and its application on chaotic image encryption. Inf Sci 547:1154\u20131169","journal-title":"Inf Sci"},{"key":"7589_CR28","doi-asserted-by":"publisher","first-page":"160433","DOI":"10.1109\/Access.628763910.1109\/ACCESS.2020.3020746","volume":"8","author":"S Ibrahim","year":"2020","unstructured":"Ibrahim S, Alhumyani H, Masud M, Alshamrani SS, Cheikhrouhou O, Muhammad G, Hossain MS, Abbas AM (2020) Framework for efficient medical image encryption using dynamic S-boxes and chaotic maps. IEEE Access 8:160433\u2013160449. https:\/\/doi.org\/10.1109\/Access.628763910.1109\/ACCESS.2020.3020746","journal-title":"IEEE Access"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07589-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-022-07589-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-022-07589-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,20]],"date-time":"2022-10-20T20:57:41Z","timestamp":1666299461000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-022-07589-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,19]]},"references-count":28,"journal-issue":{"issue":"22","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["7589"],"URL":"https:\/\/doi.org\/10.1007\/s00521-022-07589-4","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,19]]},"assertion":[{"value":"2 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}