{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T21:42:04Z","timestamp":1782078124051,"version":"3.54.5"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:00:00Z","timestamp":1765497600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T00:00:00Z","timestamp":1765497600000},"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":["J Comput Virol Hack Tech"],"DOI":"10.1007\/s11416-025-00587-9","type":"journal-article","created":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T17:39:12Z","timestamp":1765561152000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A hybrid evolutionary-gradient approach for constructing vectorial Boolean functions with optimized cryptographic profiles for lightweight and post-quantum block ciphers"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-8471-0969","authenticated-orcid":false,"given":"Milad","family":"Rahmati","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8872-104X","authenticated-orcid":false,"given":"Nima","family":"Rahmati","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,12]]},"reference":[{"key":"587_CR1","doi-asserted-by":"publisher","first-page":"99200","DOI":"10.1109\/ACCESS.2023.3286517","volume":"11","author":"Y Ayd\u0131n","year":"2023","unstructured":"Ayd\u0131n, Y., \u00d6zkaynak, F.: Automated chaos-driven S-box generation and analysis tool for enhanced cryptographic resilience. IEEE Access 11, 99200\u201399214 (2023). https:\/\/doi.org\/10.1109\/ACCESS.2023.3286517","journal-title":"IEEE Access"},{"key":"587_CR2","doi-asserted-by":"publisher","first-page":"3981","DOI":"10.1007\/s11071-024-10604-z","volume":"111","author":"A Banik","year":"2025","unstructured":"Banik, A., Thounaojam, D.M., Laiphrakpam, D.S.: Image encryption based on module learning with error using dynamic S-boxes. Nonlinear Dyn. 111, 3981\u20133999 (2025). https:\/\/doi.org\/10.1007\/s11071-024-10604-z","journal-title":"Nonlinear Dyn."},{"issue":"8","key":"587_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/math11081864","volume":"11","author":"D Bikov","year":"2023","unstructured":"Bikov, D., Bouyukliev, I., Dzhumalieva-Stoeva, M.: BoolSPLG: a library with parallel algorithms for Boolean functions and S-boxes for GPU. Mathematics 11(8), 1\u201316 (2023). https:\/\/doi.org\/10.3390\/math11081864","journal-title":"Mathematics"},{"issue":"1","key":"587_CR4","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/TCSI.2024.3360642","volume":"71","author":"L Budaghyan","year":"2024","unstructured":"Budaghyan, L., Ima\u00f1a, J.L.: Low-complexity hardware architecture of APN permutations using TU-decomposition. IEEE Trans. Circuits Syst. I 71(1), 12\u201324 (2024). https:\/\/doi.org\/10.1109\/TCSI.2024.3360642","journal-title":"IEEE Trans. Circuits Syst. I"},{"key":"587_CR5","doi-asserted-by":"crossref","unstructured":"Canteaut, A., et al.: Saturnin: a suite of lightweight symmetric algorithms for post-quantum security. Inria HAL (2019). Available: https:\/\/inria.hal.science\/hal-02436763","DOI":"10.46586\/tosc.v2020.iS1.160-207"},{"key":"587_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.pmcj.2024.101781","volume":"87","author":"JY Feng","year":"2024","unstructured":"Feng, J.Y., et al.: INLEC: an involutive and low energy lightweight block cipher for internet of things. Pervasive Mobile Comput. 87, 1\u201312 (2024). https:\/\/doi.org\/10.1016\/j.pmcj.2024.101781","journal-title":"Pervasive Mobile Comput."},{"issue":"3","key":"587_CR7","first-page":"1323","volume":"31","author":"A Indumathi","year":"2022","unstructured":"Indumathi, A., Sumathi, G.: Construction of key-dependent S-box for secure cloud storage. Intell. Autom. Soft Comput. 31(3), 1323\u20131336 (2022)","journal-title":"Intell. Autom. Soft Comput."},{"key":"587_CR8","doi-asserted-by":"publisher","unstructured":"Jeon, Y., Baek, S.,  Kim, J.: Learning-Driven Function Generator for Adaptive Improvement of Boolean Function Sets Using Reward-Based Evolution Under Cryptographic Constraints. IEEE Trans. Inf. Forens. Security, vol. 17, pp. 2345-2358 (2022). https:\/\/doi.org\/10.1109\/TIFS.2022.3187654","DOI":"10.1109\/TIFS.2022.3187654"},{"issue":"4","key":"587_CR9","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1109\/TC.2024.3351820","volume":"73","author":"Y Jeon","year":"2024","unstructured":"Jeon, Y., Baek, S., Kim, J.: Towards finding S-box circuits with optimal multiplicative complexity. IEEE Trans. Comput. 73(4), 910\u2013922 (2024). https:\/\/doi.org\/10.1109\/TC.2024.3351820","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"587_CR10","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1007\/s12095-021-00547-2","volume":"14","author":"Y Jeon","year":"2022","unstructured":"Jeon, Y., et al.: Differential uniformity and linearity of S-boxes by multiplicative complexity. Cryptogr. Commun. 14(4), 841\u2013859 (2022). https:\/\/doi.org\/10.1007\/s12095-021-00547-2","journal-title":"Cryptogr. Commun."},{"key":"587_CR11","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/3576915.3616579","volume":"2","author":"S Kim","year":"2023","unstructured":"Kim, S., et al.: AIM: symmetric primitive for shorter signatures with stronger security. Proc. ACM Asia Conf. Comput. Commun. Security 2, 34\u201348 (2023). https:\/\/doi.org\/10.1145\/3576915.3616579","journal-title":"Proc. ACM Asia Conf. Comput. Commun. Security"},{"issue":"10","key":"587_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/electronics13101825","volume":"13","author":"O Kuznetsov","year":"2024","unstructured":"Kuznetsov, O., et al.: Enhancing cryptographic primitives through dynamic cost function optimization in heuristic search. Electronics 13(10), 1\u201324 (2024). https:\/\/doi.org\/10.3390\/electronics13101825","journal-title":"Electronics"},{"key":"587_CR13","unstructured":"Lin, D., et al.: On the construction of quantum circuits for S-boxes with different criteria based on the SAT solver. Cryptology ePrint Archive, Paper 2024\/565 (2024)"},{"key":"587_CR14","doi-asserted-by":"publisher","unstructured":"Lin, D., Zou, C.,  Wang, J.: Approximating Logical Functions in Continuous Space for Spectral and Algebraic Property Adjustments in Cryptographic Primitives. Cryptogr. Commun., vol. 15, no. 3, pp. 567-582 May (2023). https:\/\/doi.org\/10.1007\/s12095-022-00592-x","DOI":"10.1007\/s12095-022-00592-x"},{"key":"587_CR15","unstructured":"Naseer, M. et al.: S-box security analysis of NIST lightweight cryptography candidates: a critical empirical study,\u201d arXiv preprint, arXiv:2404.06094 (2024)"},{"issue":"3","key":"587_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/cryptography7030039","volume":"7","author":"A Nitaj","year":"2023","unstructured":"Nitaj, A., Rachidi, T.: Applications of neural network-based AI in cryptography. Cryptography 7(3), 1\u201318 (2023). https:\/\/doi.org\/10.3390\/cryptography7030039","journal-title":"Cryptography"},{"issue":"1","key":"587_CR17","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1007\/s00500-024-09912-8","volume":"28","author":"MB Savadkouhi","year":"2024","unstructured":"Savadkouhi, M.B., Tootkaboni, M.A.: S-boxes design based on the Lu-Chen system and their application in image encryption. Soft. Comput. 28(1), 1021\u20131035 (2024). https:\/\/doi.org\/10.1007\/s00500-024-09912-8","journal-title":"Soft. Comput."},{"issue":"1","key":"587_CR18","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/s12095-023-00661-3","volume":"16","author":"MJ Steiner","year":"2024","unstructured":"Steiner, M.J.: A lower bound for differential uniformity by multiplicative complexity & bijective functions of multiplicative complexity 1 over finite fields. Cryptogr. Commun. 16(1), 211\u2013225 (2024). https:\/\/doi.org\/10.1007\/s12095-023-00661-3","journal-title":"Cryptogr. Commun."},{"key":"587_CR19","doi-asserted-by":"publisher","first-page":"134112","DOI":"10.1109\/ACCESS.2024.3361839","volume":"12","author":"HM Waseem","year":"2024","unstructured":"Waseem, H.M., et al.: Constructing highly nonlinear cryptographic balanced Boolean functions on learning capabilities of recurrent neural networks. IEEE Access 12, 134112\u2013134125 (2024). https:\/\/doi.org\/10.1109\/ACCESS.2024.3361839","journal-title":"IEEE Access"},{"key":"587_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/s41598-023-28002-7","volume":"13","author":"HM Waseem","year":"2023","unstructured":"Waseem, H.M., Hwang, S.O.: Design of highly nonlinear confusion component based on entangled points of quantum spin states. Sci. Rep. 13, 1\u201312 (2023). https:\/\/doi.org\/10.1038\/s41598-023-28002-7","journal-title":"Sci. Rep."}],"container-title":["Journal of Computer Virology and Hacking Techniques"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-025-00587-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11416-025-00587-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11416-025-00587-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T17:39:13Z","timestamp":1765561153000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11416-025-00587-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,12]]},"references-count":20,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,12]]}},"alternative-id":["587"],"URL":"https:\/\/doi.org\/10.1007\/s11416-025-00587-9","relation":{},"ISSN":["2263-8733"],"issn-type":[{"value":"2263-8733","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,12]]},"assertion":[{"value":"31 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 November 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2025","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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"7"}}