{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T17:17:30Z","timestamp":1786814250865,"version":"build-2736575974"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T00:00:00Z","timestamp":1761091200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"},{"start":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T00:00:00Z","timestamp":1761091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci Rep"],"DOI":"10.1038\/s41598-025-20773-5","type":"journal-article","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T09:52:04Z","timestamp":1761126724000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Enhanced security of affine ciphers using digraph transformation and a modified three pass protocol"],"prefix":"10.1038","volume":"15","author":[{"given":"Seble","family":"Bete","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samuel Asferaw","family":"Demilew","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tefera Alagaw","family":"Woldegiworgis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Getaneh Geto","family":"Tsegaye","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dagne Walle","family":"Girmaw","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,10,22]]},"reference":[{"key":"20773_CR1","doi-asserted-by":"publisher","unstructured":"Agrawal, S., Patel, M. & Sinhal, A. An enhance security of the color image using asymmetric rsa algorithm. In Proc. Int. Conf. Commun. Comput. Technol., 279\u2013286, (2017). https:\/\/doi.org\/10.1007\/978-981-15-5077-5_25","DOI":"10.1007\/978-981-15-5077-5_25"},{"key":"20773_CR2","doi-asserted-by":"publisher","unstructured":"Gupta, S., Johari, R. & Garg, P. Cloud based cyclic cryptographic technique and its comparative analysis with classical cipher techniques. In Proc. 5th Int. Conf. Signal Process. Integr. Networks (SPIN), 332\u2013337, (2018). https:\/\/doi.org\/10.1109\/SPIN.2018. 8474121.","DOI":"10.1109\/SPIN.2018"},{"key":"20773_CR3","doi-asserted-by":"publisher","unstructured":"Ritonga, R. P., Zarlis, M. & Nababan, E. B. Modification affine cipher transform digraph to squared the value of \u2018n\u2019 in text security. In Proc. IEEE, (2020). https:\/\/doi.org\/10.1109\/ELTICOM50775.2020.9230503","DOI":"10.1109\/ELTICOM50775.2020.9230503"},{"key":"20773_CR4","doi-asserted-by":"publisher","unstructured":"Nguyen, D. M. & Kim, S. A quantum three pass protocol with phase estimation for many bits transfer. In Proc. IEEE, (2019). https:\/\/doi.org\/10.1109\/ATC.2019.8924514","DOI":"10.1109\/ATC.2019.8924514"},{"key":"20773_CR5","doi-asserted-by":"publisher","unstructured":"Aung, T. M. & Hlal, N. N. A complex polyalphabetic cipher technique myanmar polyalphabetic cipher. In Proc. IEEE, (2019). https:\/\/doi.org\/10.1109\/ICCCI.2019.8821797","DOI":"10.1109\/ICCCI.2019.8821797"},{"key":"20773_CR6","doi-asserted-by":"publisher","first-page":"2913","DOI":"10.30534\/ijeter\/2020\/06872020","volume":"8","author":"G Thirunavukkarasu","year":"2020","unstructured":"Thirunavukkarasu, G., Arroyo, J. C. T. & Delima, A. J. P. A keystream-based affine cipher for dynamic encryption. Int. J. Emerg. Trends Eng. Res. 8, 2913\u20132918. https:\/\/doi.org\/10.30534\/ijeter\/2020\/06872020 (2020).","journal-title":"Int. J. Emerg. Trends Eng. Res."},{"key":"20773_CR7","unstructured":"Sriramoju, S. B. Modification affine ciphers algorithm for cryptography password. Int. J. Res. Sci. Eng. 3(2), 346-351 (2017)."},{"key":"20773_CR8","doi-asserted-by":"publisher","unstructured":"Wulandari, Yana, S. & Cryptography A combination of caesar and affine cipher to conceal the message. In Proc. Int. Conf. Sci. Eng., vol. 3, (2020). https:\/\/doi.org\/10.14421\/icse.v3.595","DOI":"10.14421\/icse.v3.595"},{"key":"20773_CR9","doi-asserted-by":"publisher","unstructured":"Ridho, A., Dewi, A. M. & Zarlis, M. Analysis of possibility of the combination of affine cipher algorithm with one time pad cipher using the three pass protocol method in text security. In Proc. Int. Conf. Comput. Sci. Appl. Math., (2019). https:\/\/doi.org\/10.1088\/1742-6596\/1255\/1\/012028","DOI":"10.1088\/1742-6596\/1255\/1\/012028"},{"key":"20773_CR10","doi-asserted-by":"publisher","unstructured":"Rahim, R., Rosid, M. A., Fitrani, A. S. & Daengs, A. Enhancement three-pass protocol security with combination Caesar cipher and vigen\u00e8re cipher. J. Phys. : Conf. Ser. 1402 https:\/\/doi.org\/10.1088\/1742-6596\/1402\/6\/066045 (2019).","DOI":"10.1088\/1742-6596\/1402\/6\/066045"},{"key":"20773_CR11","doi-asserted-by":"publisher","first-page":"338","DOI":"10.25046\/aj020501","volume":"2","author":"S Subandi","year":"2017","unstructured":"Subandi, S., Purnomo, W. & Iswandari, E. W. Three-pass protocol implementation for encryption and decryption with affine cipher. Adv. Sci. Technol. Eng. Syst. J. 2, 338\u2013344. https:\/\/doi.org\/10.25046\/aj020501 (2017).","journal-title":"Adv. Sci. Technol. Eng. Syst. J."},{"key":"20773_CR12","doi-asserted-by":"publisher","unstructured":"Rachmawati, D. & Budiman, M. A. New approach toward data hiding by using affine cipher and least significant bit algorithm. In Proc. 4th Int. Conf. Comput. Appl. Inf. Process. Technol. (CAIPT), (2017). https:\/\/doi.org\/10.1109\/CAIPT.2017. 8320737.","DOI":"10.1109\/CAIPT.2017"},{"key":"20773_CR13","first-page":"1","volume":"143","author":"AM Abdullah","year":"2016","unstructured":"Abdullah, A. M. & Hama, R. H. New approach to encrypt and Decrypt data in image using cryptography and steganography algorithm. Int. J. Comput. Appl. 143, 1\u20136 (2016).","journal-title":"Int. J. Comput. Appl."},{"key":"20773_CR14","doi-asserted-by":"publisher","DOI":"10.1088\/1742-6596\/1217\/1\/012073","author":"M Jannah","year":"2019","unstructured":"Jannah, M. & Surarso, B. Sutimin. A combination of Rivest Shamir adleman (rsa) and affine cipher method on improvement of the effectiveness and security of text message. J. Phys. : Conf. Ser. https:\/\/doi.org\/10.1088\/1742-6596\/1217\/1\/012073 (2019).","journal-title":"J. Phys. : Conf. Ser."},{"key":"20773_CR15","doi-asserted-by":"publisher","unstructured":"Shashankh, S. et al. Springer, Singapore,. Affine recurrence based key scheduling algorithm for the advanced encryption standard. In Proc. 4th ICCNCT, 73\u201384, (2021). https:\/\/doi.org\/10.1007\/978-981-16-3728-5_6","DOI":"10.1007\/978-981-16-3728-5_6"},{"key":"20773_CR16","doi-asserted-by":"publisher","DOI":"10.14445\/22315373\/IJIJMTT-V68I3P503","author":"C Manjula","year":"2022","unstructured":"Manjula, C. & Divakarla, C. K. Exchange of message using fourier transforms via affine transformation. Int. J. Math. Trends Technol. https:\/\/doi.org\/10.14445\/22315373\/IJIJMTT-V68I3P503 (2022).","journal-title":"Int. J. Math. Trends Technol."},{"key":"20773_CR17","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1109\/MMUL.2024.3484414","volume":"31","author":"K You","year":"2024","unstructured":"You, K., Chen, P. & Li, C. Cryptanalyzing an image encryption algorithm underpinned by a 3-d boolean Convolution neural network. IEEE MultiMedia. 31, 17\u201324. https:\/\/doi.org\/10.1109\/MMUL.2024.3484414 (2024).","journal-title":"IEEE MultiMedia"}],"container-title":["Scientific Reports"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-20773-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-20773-5","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-20773-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T09:52:05Z","timestamp":1761126725000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.nature.com\/articles\/s41598-025-20773-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,22]]},"references-count":17,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["20773"],"URL":"https:\/\/doi.org\/10.1038\/s41598-025-20773-5","relation":{},"ISSN":["2045-2322"],"issn-type":[{"value":"2045-2322","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,22]]},"assertion":[{"value":"14 May 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 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":"36891"}}