{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T18:50:52Z","timestamp":1785351052145,"version":"3.55.0"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T00:00:00Z","timestamp":1737244800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T00:00:00Z","timestamp":1737244800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100007161","name":"Secretar\u00eda de Investigaci\u00f3n y Posgrado, Instituto Polit\u00e9cnico Nacional","doi-asserted-by":"publisher","award":["SIP-20241716"],"award-info":[{"award-number":["SIP-20241716"]}],"id":[{"id":"10.13039\/501100007161","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007161","name":"Secretar\u00eda de Investigaci\u00f3n y Posgrado, Instituto Polit\u00e9cnico Nacional","doi-asserted-by":"publisher","award":["SIP-20241356"],"award-info":[{"award-number":["SIP-20241356"]}],"id":[{"id":"10.13039\/501100007161","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>Given the large volumes of sensitive information transmitted over the Internet, digital signatures are essential for verifying message authenticity and integrity. A key challenge is minimizing computationally intensive operations, such as modular inverses, without compromising security. In this research, we propose the DSADH<jats:inline-formula>\n              <jats:tex-math>$$\\pi$$<\/jats:tex-math>\n            <\/jats:inline-formula> algorithm, which introduces a confusion step directly into the signature itself, rather than only applying it to the message, using a dynamic substitution box. It is generated with the number pi and changes with each signing. In addition, to enhance security, this work uses a 2048-bit prime, double the length frequently used. This proposal induces chaotic behavior in the signature, making it highly sensitive to any changes in the signer\u2019s private key or message content, thereby enhancing authentication and integrity verification. Moreover, the proposed algorithm computes a single multiplicative modular inverse during verification and none during signing, unlike other approaches that require inverse computation in both stages. Since the required inverse is for the Diffie-Hellman session key, it always exists and can be precomputed per communication rather than per message. Consequently, DSADH<jats:inline-formula>\n              <jats:tex-math>$$\\pi$$<\/jats:tex-math>\n            <\/jats:inline-formula> is on average 45 times faster than DSA. Additionally, we introduce a method to assess signature security by constructing images from signature bytes generated by slight changes to the signer\u2019s private key and message. Then, their chaotic behavior is evaluated with cryptographic metrics.<\/jats:p>","DOI":"10.1038\/s41598-024-83943-x","type":"journal-article","created":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T06:05:51Z","timestamp":1737266751000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A chaotic digital signature algorithm based on a dynamic substitution box"],"prefix":"10.1038","volume":"15","author":[{"given":"Rolando","family":"Flores-Carapia","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"V\u00edctor Manuel","family":"Silva-Garc\u00eda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Manuel Alejandro","family":"Cardona-L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Miguel Gabriel","family":"Villarreal-Cervantes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,1,19]]},"reference":[{"key":"83943_CR1","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1109\/MC.1983.1654294","volume":"16","author":"Aki","year":"1983","unstructured":"Aki,. Digital signatures: A tutorial survey. Computer 16, 15\u201324. https:\/\/doi.org\/10.1109\/MC.1983.1654294 (1983).","journal-title":"Computer"},{"key":"83943_CR2","doi-asserted-by":"publisher","first-page":"2020","DOI":"10.1186\/s13638-020-01665-w","volume":"1\u201315","author":"W Fang","year":"2020","unstructured":"Fang, W. et al. Digital signature scheme for information non-repudiation in blockchain: a state of the art review. EURASIP J. Wirel. Commun. Netw. 1\u201315, 2020. https:\/\/doi.org\/10.1186\/s13638-020-01665-w (2020).","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"83943_CR3","doi-asserted-by":"publisher","unstructured":"NIST. Digital signature standard. FIPS PUB 186-4, https:\/\/doi.org\/10.6028\/NIST.FIPS.186-4 (2013).","DOI":"10.6028\/NIST.FIPS.186-4"},{"key":"83943_CR4","doi-asserted-by":"publisher","unstructured":"NIST. Digital signature standard. FIPS PUB 186-5, https:\/\/doi.org\/10.6028\/NIST.FIPS.186-5 (2023).","DOI":"10.6028\/NIST.FIPS.186-5"},{"key":"83943_CR5","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/s102070100002","volume":"1","author":"D Johnson","year":"2001","unstructured":"Johnson, D., Menezes, A. & Vanstone, S. The elliptic curve digital signature algorithm (ECDSA). Int. J. Inf. Secur. 1, 36\u201363. https:\/\/doi.org\/10.1007\/s102070100002 (2001).","journal-title":"Int. J. Inf. Secur."},{"key":"83943_CR6","doi-asserted-by":"publisher","unstructured":"Bufalo, M., Bufalo, D. & Orlando, G. Some properties of the computation of the modular inverse with applications in cryptography. Computation 11, https:\/\/doi.org\/10.3390\/computation11040070 (2023).","DOI":"10.3390\/computation11040070"},{"key":"83943_CR7","doi-asserted-by":"publisher","unstructured":"Al\u2013Sewadi, H.\u00a0A., Al-Shnawa, R.\u00a0A. & Rifaat, M.\u00a0M. Signature verification time reduction for gost digital signature algorithm. In Proceedings of the 2021 International Conference on Communication & Information Technology (ICICT), 279\u2013283, https:\/\/doi.org\/10.1109\/ICICT52195.2021.9568409 (Basrah, Iraq, 2021).","DOI":"10.1109\/ICICT52195.2021.9568409"},{"key":"83943_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2022.100471","volume":"45","author":"K Bhattacharjee","year":"2022","unstructured":"Bhattacharjee, K. & Das, S. A search for good pseudo-random number generators: Survey and empirical studies. Comput. Sci. Rev. 45, 100471. https:\/\/doi.org\/10.1016\/j.cosrev.2022.100471 (2022).","journal-title":"Comput. Sci. Rev."},{"key":"83943_CR9","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s11277-021-08629-3","volume":"121","author":"X-B Yang","year":"2021","unstructured":"Yang, X.-B. et al. Nomop-ecdsa: a lightweight ecdsa engine for internet of things. Wirel. Pers. Commun. 121, 171\u2013190. https:\/\/doi.org\/10.1007\/s11277-021-08629-3 (2021).","journal-title":"Wirel. Pers. Commun."},{"key":"83943_CR10","doi-asserted-by":"publisher","first-page":"77058","DOI":"10.1109\/ACCESS.2021.3082704","volume":"9","author":"S-G Liu","year":"2021","unstructured":"Liu, S.-G., Chen, W.-Q. & Liu, J.-L. An efficient double parameter elliptic curve digital signature algorithm for blockchain. IEEE Access 9, 77058\u201377066. https:\/\/doi.org\/10.1109\/ACCESS.2021.3082704 (2021).","journal-title":"IEEE Access"},{"key":"83943_CR11","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/j.comcom.2024.01.016","volume":"216","author":"JJ Puthiyidam","year":"2024","unstructured":"Puthiyidam, J. J., Joseph, S. & Bhushan, B. Temporal ECDSA: A timestamp and signature mask enabled ECDSA algorithm for iot client node authentication. Comput. Commun. 216, 307\u2013323. https:\/\/doi.org\/10.1016\/j.comcom.2024.01.016 (2024).","journal-title":"Comput. Commun."},{"key":"83943_CR12","doi-asserted-by":"publisher","first-page":"454","DOI":"10.3390\/e25030454","volume":"25","author":"F Wu","year":"2023","unstructured":"Wu, F., Zhou, B. & Zhang, X. Identity-based proxy signature with message recovery over ntru lattice. Entropy 25, 454. https:\/\/doi.org\/10.3390\/e25030454 (2023).","journal-title":"Entropy"},{"key":"83943_CR13","doi-asserted-by":"publisher","first-page":"10509","DOI":"10.1007\/s11042-020-10059-5","volume":"80","author":"N Hematpour","year":"2021","unstructured":"Hematpour, N., Ahadpour, S. & Behnia, S. Presence of dynamics of quantum dots in the digital signature using DNA alphabet and chaotic S-box. Multimed. Tools Appl. 80, 10509\u201310531. https:\/\/doi.org\/10.1007\/s11042-020-10059-5 (2021).","journal-title":"Multimed. Tools Appl."},{"key":"83943_CR14","doi-asserted-by":"publisher","unstructured":"Alam, S., Jamil, A., Saldhi, A. & Ahmad, M. Digital image authentication and encryption using digital signature. In Proceedings of the 2015 International Conference on Advances in Computer Engineering and Applications, 332\u2013336, https:\/\/doi.org\/10.1109\/ICACEA.2015.7164725 (Ghaziabad, India, 2015).","DOI":"10.1109\/ICACEA.2015.7164725"},{"key":"83943_CR15","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/j.ins.2019.09.084","volume":"512","author":"JH Seo","year":"2020","unstructured":"Seo, J. H. Efficient digital signatures from RSA without random oracles. Inf. Sci. 512, 471\u2013480. https:\/\/doi.org\/10.1016\/j.ins.2019.09.084 (2020).","journal-title":"Inf. Sci."},{"key":"83943_CR16","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1007\/s11071-013-1018-1","volume":"74","author":"K Chain","year":"2013","unstructured":"Chain, K. & Kuo, W.-C. A new digital signature scheme based on chaotic maps. Nonlinear Dyn. 74, 1003\u20131012. https:\/\/doi.org\/10.1007\/s11071-013-1018-1 (2013).","journal-title":"Nonlinear Dyn."},{"key":"83943_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.jare.2020.08.015","volume":"32","author":"C Meshram","year":"2021","unstructured":"Meshram, C. et al. Fractional chaotic maps based short signature scheme under human-centered IoT environments. J. Adv. Res. 32, 139\u2013148. https:\/\/doi.org\/10.1016\/j.jare.2020.08.015 (2021).","journal-title":"J. Adv. Res."},{"key":"83943_CR18","doi-asserted-by":"publisher","first-page":"8117","DOI":"10.3390\/app13148117","volume":"13","author":"Y Qin","year":"2023","unstructured":"Qin, Y. & Zhang, B. Privacy-preserving biometrics image encryption and digital signature technique using Arnold and ElGamal. Appl. Sci. 13, 8117. https:\/\/doi.org\/10.3390\/app13148117 (2023).","journal-title":"Appl. Sci."},{"key":"83943_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.117861","volume":"206","author":"B Jasra","year":"2022","unstructured":"Jasra, B. & Moon, A. H. Color image encryption and authentication using dynamic DNA encoding and hyper chaotic system. Expert Syst. Appl. 206, 117861. https:\/\/doi.org\/10.1016\/j.eswa.2022.117861 (2022).","journal-title":"Expert Syst. Appl."},{"key":"83943_CR20","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.apm.2024.04.012","volume":"131","author":"Z Guo","year":"2024","unstructured":"Guo, Z., Chen, S.-H., Zhou, L. & Gong, L.-H. Optical image encryption and authentication scheme with computational ghost imaging. Appl. Math. Model. 131, 49\u201366. https:\/\/doi.org\/10.1016\/j.apm.2024.04.012 (2024).","journal-title":"Appl. Math. Model."},{"key":"83943_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3530054","volume":"55","author":"A Baksi","year":"2022","unstructured":"Baksi, A., Bhasin, S., Breier, J., Jap, D. & Saha, D. A survey on fault attacks on symmetric key cryptosystems. ACM Comput. Surv. 55, 1\u201334. https:\/\/doi.org\/10.1145\/3530054 (2022).","journal-title":"ACM Comput. Surv."},{"key":"83943_CR22","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W. & Hellman, M. New directions in cryptography. IEEE Trans. Inf. Theory 22, 644\u2013654. https:\/\/doi.org\/10.1109\/TIT.1976.1055638 (1976).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"83943_CR23","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.dcan.2022.04.028","volume":"9","author":"X Huang","year":"2023","unstructured":"Huang, X., Dong, Y., Ye, G., Yap, W.-S. & Goi, B.-M. Visually meaningful image encryption algorithm based on digital signature. Digit. Commun. Netw. 9, 159\u2013165. https:\/\/doi.org\/10.1016\/j.dcan.2022.04.028 (2023).","journal-title":"Digit. Commun. Netw."},{"key":"83943_CR24","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1080\/01611194.2022.2155093","volume":"48","author":"E Almaraz Luengo","year":"2024","unstructured":"Almaraz Luengo, E. Statistical tests suites analysis methods. cryptographic recommendations. Cryptologia 48, 219\u2013251. https:\/\/doi.org\/10.1080\/01611194.2022.2155093 (2024).","journal-title":"Cryptologia"},{"key":"83943_CR25","doi-asserted-by":"publisher","first-page":"9709","DOI":"10.1007\/s11042-023-15673-7","volume":"83","author":"A Farooq","year":"2024","unstructured":"Farooq, A., Tariq, S., Amin, A., Qureshi, M. A. & Memon, K. H. Towards the design of new cryptographic algorithm and performance evaluation measures. Multimed. Tools Appl. 83, 9709\u20139759. https:\/\/doi.org\/10.1007\/s11042-023-15673-7 (2024).","journal-title":"Multimed. Tools Appl."},{"key":"83943_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.physd.2020.132816","volume":"417","author":"PM Cincotta","year":"2021","unstructured":"Cincotta, P. M., Giordano, C. M., Silva, R. A. & Beaug\u00e9, C. The Shannon entropy: An efficient indicator of dynamical stability. Physica D 417, 132816. https:\/\/doi.org\/10.1016\/j.physd.2020.132816 (2021).","journal-title":"Physica D"},{"key":"83943_CR27","doi-asserted-by":"publisher","first-page":"74553","DOI":"10.1109\/ACCESS.2020.2988658","volume":"8","author":"E Simion","year":"2020","unstructured":"Simion, E. Entropy and randomness: From analogic to quantum world. IEEE Access 8, 74553\u201374561. https:\/\/doi.org\/10.1109\/ACCESS.2020.2988658 (2020).","journal-title":"IEEE Access"},{"key":"83943_CR28","doi-asserted-by":"publisher","first-page":"935","DOI":"10.1007\/s12095-017-0276-z","volume":"10","author":"S Bhattacharya","year":"2018","unstructured":"Bhattacharya, S. & Nandi, M. A note on the chi-square method: A tool for proving cryptographic security. Cryptogr. Commun. 10, 935\u2013957. https:\/\/doi.org\/10.1007\/s12095-017-0276-z (2018).","journal-title":"Cryptogr. Commun."},{"key":"83943_CR29","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.3390\/e24101503","volume":"24","author":"SR Davies","year":"2022","unstructured":"Davies, S. R., Macfarlane, R. & Buchanan, W. J. Comparison of entropy calculation methods for ransomware encrypted file identification. Entropy 24, 1503. https:\/\/doi.org\/10.3390\/e24101503 (2022).","journal-title":"Entropy"},{"key":"83943_CR30","doi-asserted-by":"publisher","first-page":"2233","DOI":"10.1109\/LCOMM.2013.111113.131879","volume":"17","author":"D Horgan","year":"2013","unstructured":"Horgan, D. & Murphy, C. C. On the convergence of the chi square and noncentral chi square distributions to the normal distribution. IEEE Commun. Lett. 17, 2233\u20132236. https:\/\/doi.org\/10.1109\/LCOMM.2013.111113.131879 (2013).","journal-title":"IEEE Commun. Lett."},{"key":"83943_CR31","doi-asserted-by":"publisher","first-page":"1164","DOI":"10.1109\/TIT.2019.2947045","volume":"66","author":"A Iwasaki","year":"2020","unstructured":"Iwasaki, A. Deriving the variance of the discrete Fourier transform test using Parseval\u2019s theorem. IEEE Trans. Inf. Theory 66, 1164\u20131170. https:\/\/doi.org\/10.1109\/TIT.2019.2947045 (2020).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"83943_CR32","doi-asserted-by":"publisher","unstructured":"NIST. A statistical test suite for random and pseudorandom number generators for cryptographic applications. SP 800-22, https:\/\/doi.org\/10.6028\/NIST.SP.800-22r1a (2010).","DOI":"10.6028\/NIST.SP.800-22r1a"},{"key":"83943_CR33","doi-asserted-by":"publisher","unstructured":"Bailey, D. H. et al. An empirical approach to the normality of\u00a0\u03c0. Exp. Math. 21, 375\u2013384. https:\/\/doi.org\/10.1080\/10586458.2012.665333 (2012).","DOI":"10.1080\/10586458.2012.665333"},{"key":"83943_CR34","doi-asserted-by":"publisher","unstructured":"Erkan, U., Toktas, A., Toktas, F. & Alenezi, F. 2D e\u03c0-map for image encryption. Inf. Sci. 589, 770\u2013789. https:\/\/doi.org\/10.1016\/j.ins.2021.12.126 (2022).","DOI":"10.1016\/j.ins.2021.12.126"},{"key":"83943_CR35","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1090\/S0025-5718-97-00856-9","volume":"66","author":"D Bailey","year":"1997","unstructured":"Bailey, D., Borwein, P. & Plouffe, S. On the rapid computation of various polylogarithmic constants. Math. Comput. 66, 903\u2013913 (1997).","journal-title":"Math. Comput."},{"key":"83943_CR36","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/s11071-016-3046-0","volume":"87","author":"A Belazi","year":"2017","unstructured":"Belazi, A., Khan, M., El-Latif, A. A. A. & Belghith, S. Efficient cryptosystem approaches: S-boxes and permutation-substitution-based encryption. Nonlinear Dyn. 87, 337\u2013361. https:\/\/doi.org\/10.1007\/s11071-016-3046-0 (2017).","journal-title":"Nonlinear Dyn."},{"key":"83943_CR37","first-page":"20","volume":"23","author":"T Ball","year":"2020","unstructured":"Ball, T., Beckford, J., Dalenberg, P., Edgar, T. & Rajabi, T. Some combinatorics of factorial base representations. J. Integer Seq. 23, 20\u20133 (2020).","journal-title":"J. Integer Seq."},{"key":"83943_CR38","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/BF01937486","volume":"24","author":"S Zaks","year":"1984","unstructured":"Zaks, S. A new algorithm for generation of permutations. Bit 24, 196\u2013204 (1984).","journal-title":"Bit"},{"key":"83943_CR39","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1017\/S0004972722000909","volume":"107","author":"T Morrill","year":"2023","unstructured":"Morrill, T. On the Euclidean algorithm: rhythm without recursion. Bull. Aust. Math. Soc. 107, 361\u2013367. https:\/\/doi.org\/10.1017\/S0004972722000909 (2023).","journal-title":"Bull. Aust. Math. Soc."},{"key":"83943_CR40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ijleo.2021.168548","volume":"253","author":"S Deb","year":"2022","unstructured":"Deb, S. & Behera, P. K. Design of key-dependent bijective S-boxes for color image cryptosystem. Optik 253, 168548. https:\/\/doi.org\/10.1016\/j.ijleo.2021.168548 (2022).","journal-title":"Optik"},{"key":"83943_CR41","doi-asserted-by":"publisher","first-page":"890","DOI":"10.3390\/sym12060890","volume":"12","author":"ST Ishmukhametov","year":"2020","unstructured":"Ishmukhametov, S. T., Mubarakov, B. G. & Rubtsova, R. G. On the number of witnesses in the Miller-Rabin primality test. Symmetry 12, 890. https:\/\/doi.org\/10.3390\/sym12060890 (2020).","journal-title":"Symmetry"},{"key":"83943_CR42","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1016\/0022-314X(80)90084-0","volume":"12","author":"MO Rabin","year":"1980","unstructured":"Rabin, M. O. Probabilistic algorithm for testing primality. J. Number Theory 12, 128\u2013138. https:\/\/doi.org\/10.1016\/0022-314X(80)90084-0 (1980).","journal-title":"J. Number Theory"},{"key":"83943_CR43","doi-asserted-by":"publisher","unstructured":"NIST. SHA-3 Standard. FIPS PUB 202, https:\/\/doi.org\/10.6028\/NIST.FIPS.202 (2015).","DOI":"10.6028\/NIST.FIPS.202"},{"key":"83943_CR44","doi-asserted-by":"publisher","unstructured":"NIST. Advanced Encryption Standard (AES). FIPS 197, https:\/\/doi.org\/10.6028\/NIST.FIPS.197-upd1 (2023).","DOI":"10.6028\/NIST.FIPS.197-upd1"},{"key":"83943_CR45","doi-asserted-by":"publisher","first-page":"31","DOI":"10.23919\/JCC.2020.04.004","volume":"17","author":"B Qi","year":"2020","unstructured":"Qi, B., Ma, J. & Lv, K. Improved algorithm for solving discrete logarithm problem by expanding factor. China Commun. 17, 31\u201341. https:\/\/doi.org\/10.23919\/JCC.2020.04.004 (2020).","journal-title":"China Commun."},{"key":"83943_CR46","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.procs.2018.10.125","volume":"141","author":"F Aliyu","year":"2018","unstructured":"Aliyu, F., Sheltami, T. & Shakshuki, E. M. A detection and prevention technique for man in the middle attack in fog computing. Procedia Comput. Sci. 141, 24\u201331. https:\/\/doi.org\/10.1016\/j.procs.2018.10.125 (2018).","journal-title":"Procedia Comput. Sci."},{"key":"83943_CR47","doi-asserted-by":"publisher","DOI":"10.1016\/j.jisa.2021.103065","volume":"64","author":"AY Al-Dweik","year":"2022","unstructured":"Al-Dweik, A. Y., Hussain, I., Saleh, M. & Mustafa, M. T. A novel method to generate key-dependent s-boxes with identical algebraic properties. J. Inf. Secur. Appl. 64, 103065. https:\/\/doi.org\/10.1016\/j.jisa.2021.103065 (2022).","journal-title":"J. Inf. Secur. Appl."}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-83943-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-83943-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-83943-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T06:05:53Z","timestamp":1737266753000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-024-83943-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,19]]},"references-count":47,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["83943"],"URL":"https:\/\/doi.org\/10.1038\/s41598-024-83943-x","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1,19]]},"assertion":[{"value":"3 September 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 January 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":"Competing interests"}}],"article-number":"2435"}}