{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T05:36:59Z","timestamp":1769319419558,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:00:00Z","timestamp":1706745600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Netw Distrib Comput"],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Cryptography secures data and serves to ensure the confidentiality of records. Playfair is a cryptographic symmetrical algorithm that encrypts statistics based on key costs. This secret is shared with an authorized person to retrieve data. In the conventional pattern, there is an area complexity and deficiency in letters, numbers, and special characters. This hassle has been overcome in previous studies by editing pattern dimensions. The fillers used throughout the enciphering were not eliminated during the retrieval process, which resulted in the indiscrimination of the retrieved statistics. The proposed method uses a separate quadrate pattern that strengthens the Playfair cipher and guarantees that the fillers are eliminated to ensure the authentic retrieval of records. The fillers indiscriminate and strengthen the set of rules in opposition to brute force and avalanche impact. The proposed algorithm was evaluated with a minimal change in the key, and was found to have an avalanche effect between 65% and 93.7%. The encrypted document is further encoded using the Lempel\u2013Ziv\u2013Markov chain algorithm (LZMA) to provide compressed second-level secured text with a compression ratio of 0.75 for a file size of 100\u00a0KB. The pattern was designed to subsidize the integrated characters found on the keyboard.<\/jats:p>","DOI":"10.1007\/s44227-023-00019-4","type":"journal-article","created":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T10:03:18Z","timestamp":1706781798000},"page":"108-118","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Modified Playfair for Text File Encryption and Meticulous Decryption with Arbitrary Fillers by Septenary Quadrate Pattern"],"prefix":"10.1007","volume":"12","author":[{"given":"N.","family":"Sugirtham","sequence":"first","affiliation":[]},{"given":"R. Sherine","family":"Jenny","sequence":"additional","affiliation":[]},{"given":"B.","family":"Thiyaneswaran","sequence":"additional","affiliation":[]},{"given":"S.","family":"Kumarganesh","sequence":"additional","affiliation":[]},{"given":"C.","family":"Venkatesan","sequence":"additional","affiliation":[]},{"given":"K. Martin","family":"Sagayam","sequence":"additional","affiliation":[]},{"given":"Lam","family":"Dang","sequence":"additional","affiliation":[]},{"given":"Linh","family":"Dinh","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7112-9966","authenticated-orcid":false,"given":"Hien","family":"Dang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,1]]},"reference":[{"issue":"504","key":"19_CR1","doi-asserted-by":"publisher","first-page":"562","DOI":"10.2307\/3621815","volume":"85","author":"S Abbott","year":"2001","unstructured":"Abbott S, van Tilborg HCA (2001) Fundamentals of cryptology: a professional reference and interative Tutoria. Math Gaz 85(504):562. https:\/\/doi.org\/10.2307\/3621815","journal-title":"Math Gaz"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Albahrani EA, Maryoosh AA, Lafta SH, Block image encryption based on modified playfair and chaotic system, J Inf Secur Appl 51, 2020 https:\/\/doi.org\/10.1016\/j.jisa.2019.102445.","DOI":"10.1016\/j.jisa.2019.102445"},{"key":"19_CR3","doi-asserted-by":"publisher","unstructured":"Mukherjee S, Chattopadhyay M, Lahiri A, Chattopadhyay S An efficient binary playfair algorithm using a 4\u00d74 Playfair Key Matrix, Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 7564 LNCS, pp. 314\u2013325, 2012, https:\/\/doi.org\/10.1007\/978-3-642-33260-9_27.","DOI":"10.1007\/978-3-642-33260-9_27"},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"Singh K, Awasthi AK Quality, reliability, security and robustness in heterogeneous networks, 115, no. January. 2013.","DOI":"10.1007\/978-3-642-37949-9"},{"issue":"11","key":"19_CR5","doi-asserted-by":"publisher","first-page":"115","DOI":"10.14569\/ijacsa.2018.0911105","volume":"9","author":"NR Al-Kazaz","year":"2018","unstructured":"Al-Kazaz NR, Teahan WJ (2018) An automatic cryptanalysis of playfair ciphers using compression. Int J Adv Comput Sci Appl 9(11):115\u2013124. https:\/\/doi.org\/10.14569\/ijacsa.2018.0911105","journal-title":"Int J Adv Comput Sci Appl"},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Maha MM, Masuduzzaman M, Bhowmik A An effective modification of play fair cipher with performance analysis using 6 \u00d7 6 matrix, ACM Int. Conf. Proceeding Ser., no. January, 2020, https:\/\/doi.org\/10.1145\/3377049.3377085.","DOI":"10.1145\/3377049.3377085"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"2021","DOI":"10.1088\/1742-6596\/1964\/2\/022016","volume":"2","author":"B Deepa","year":"1964","unstructured":"Deepa B, Maheswari V, Balaji V (1964) An efficient cryptosystem using playfair cipher together with graph labeling techniques. J Phys Conf Ser 2:2021. https:\/\/doi.org\/10.1088\/1742-6596\/1964\/2\/022016","journal-title":"J Phys Conf Ser"},{"key":"19_CR8","unstructured":"Manliclic GMM, Lamac KAR, Regala RC, MCR, Dioses RM (2023) Improving the extended 10 \u00d7 10 Polybius square key matrix for playfair, bifid, and polybius cipher, United International J Res Technol 04(07): 290\u2013295"},{"key":"19_CR9","doi-asserted-by":"publisher","unstructured":"J. C. C. Ferrer, F. E. De Guzman, K. L. E. Gardon, R. J. R. Rosales, D. A. Dell Michael Badua, and D. R. Marcelo, \u201cExtended 10 x 10 playfair cipher,\u201d 2018 IEEE 10th Int. Conf. Humanoid, Nanotechnology, Inf. Technol. Commun. Control. Environ. Manag. HNICEM 2018, pp. 1\u20134, 2019, https:\/\/doi.org\/10.1109\/HNICEM.2018.8666250.","DOI":"10.1109\/HNICEM.2018.8666250"},{"issue":"7","key":"19_CR10","doi-asserted-by":"publisher","first-page":"37","DOI":"10.5120\/7363-0192","volume":"48","author":"SS Dhenakaran","year":"2012","unstructured":"Dhenakaran SS, Ilayaraja M (2012) Extension of playfair cipher using 16x16 matrix. Int J Comput Appl 48(7):37\u201341. https:\/\/doi.org\/10.5120\/7363-0192","journal-title":"Int J Comput Appl"},{"key":"19_CR11","doi-asserted-by":"publisher","unstructured":"N. Sharma, H. Meghwal, M. Mehta, and T. Kumar, \u201cA Review on Playfair Substitution Cipher and Frequency Analysis Attack on Playfair,\u201d Proc. 2nd Int. Conf. Trends Electron. Informatics, ICOEI 2018, pp. 1\u20139, 2018, https:\/\/doi.org\/10.1109\/ICOEI.2018.8553837.","DOI":"10.1109\/ICOEI.2018.8553837"},{"key":"19_CR12","doi-asserted-by":"publisher","unstructured":"VM, Ayesha Sk (2018) A novel digital watermarking scheme for data authentication and copyright protection in 5G networks, Comput Electr Eng. 72: 589\u2013605, https:\/\/doi.org\/10.1016\/j.compeleceng.2018.02.045\/.","DOI":"10.1016\/j.compeleceng.2018.02.045"},{"key":"19_CR13","doi-asserted-by":"publisher","unstructured":"Andrew Onesimu J, Karthikeyan J, Eunice J, et al. (2022) Privacy preserving attribute-focused anonymization scheme for healthcare data publishing. IEEE Access. 10: 86979\u201386997. https:\/\/doi.org\/10.1109\/ACCESS.2022.3199433","DOI":"10.1109\/ACCESS.2022.3199433"},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.12720\/jcm.18.1.47-57","volume":"18","author":"N Mahlake","year":"2023","unstructured":"Mahlake N, Mathonsi TE, Du Plessis D, Muchenje T (2023) A lightweight encryption algorithm to enhance wireless sensor network security on the internet of things. J Commun 18(1):47\u201357. https:\/\/doi.org\/10.12720\/jcm.18.1.47-57","journal-title":"J Commun"},{"key":"19_CR15","doi-asserted-by":"publisher","unstructured":"Greeshmanth CR, Shah MA (2023) Novel secure data protection scheme using Martino homomorphic encryption, J Cloud Comput, 12(1) https:\/\/doi.org\/10.1186\/s13677-023-00425-7.","DOI":"10.1186\/s13677-023-00425-7"},{"key":"19_CR16","doi-asserted-by":"publisher","unstructured":"Srinivasarao AA, Tumma AY, Markapudi B, Chaduvula KA (2023) Smart Strategy for Data Hiding using Cryptography and Steganography, J Sci Ind Res 82(05), https:\/\/doi.org\/10.56042\/jsir.v82i05.1090.","DOI":"10.56042\/jsir.v82i05.1090"},{"issue":"1","key":"19_CR17","doi-asserted-by":"publisher","DOI":"10.1063\/5.0103474","volume":"2518","author":"K Karthikayani","year":"2022","unstructured":"Karthikayani K, Elumalai G, Jeyapiriya K, Southry SS, Gayathri S, Balamurugan A (2022) Performance analysis of various segmentation algorithms for microarray images. AIP Conf Proc 2518(1):070001. https:\/\/doi.org\/10.1063\/5.0103474","journal-title":"AIP Conf Proc"},{"key":"19_CR18","doi-asserted-by":"publisher","unstructured":"N. G. Goyal, S., Pacholi, B.S., Rao, B.A., Rai, S., Kini, \u201cParallel Message Encryption Through Playfair Cipher Using CUDA,\u201d in Evolution in Computational Intelligence. Advances in Intelligent Systems and Computing, 2021, pp. 519\u2013526, doi: https:\/\/doi.org\/10.1007\/978-981-15-5788-0_50.","DOI":"10.1007\/978-981-15-5788-0_50"},{"key":"19_CR19","doi-asserted-by":"publisher","unstructured":"Amalia, M. A. Budiman, and R. Sitepu, \u201cFile text security using Hybrid Cryptosystem with Playfair Cipher Algorithm and Knapsack Naccache-Stern Algorithm,\u201d J. Phys. Conf. Ser., vol. 978, no. 1, 2018, doi: https:\/\/doi.org\/10.1088\/1742-6596\/978\/1\/012114.","DOI":"10.1088\/1742-6596\/978\/1\/012114"},{"issue":"5","key":"19_CR20","doi-asserted-by":"publisher","first-page":"140","DOI":"10.15199\/48.2021.05.25","volume":"97","author":"J John Paul","year":"2021","unstructured":"John Paul J, Jone AA, Martin Sagayam,\"IoT based remote transit vehicle monitoring with seat availability display system,\"Przeglad Elektrotechniczny. et al (2021) ISSN 0033\u20132097, R 97(5):140\u2013145. https:\/\/doi.org\/10.15199\/48.2021.05.25","journal-title":"ISSN 0033\u20132097, R"},{"key":"19_CR21","doi-asserted-by":"publisher","unstructured":"B. Carpentieri, \u201cEfficient compression and encryption for digital data transmission,\u201d Secur. Commun. Networks, vol. 2018, 2018, doi: https:\/\/doi.org\/10.1155\/2018\/9591768.","DOI":"10.1155\/2018\/9591768"},{"key":"19_CR22","doi-asserted-by":"publisher","unstructured":"Shanthi, T., Ramprasath, M., Kavitha, A., & Muruganantham, T. (2023). Deep learning based autonomous transport system for secure vehicle and cargo atching. Intelligent Automation and Soft Computing, 35(1), 957\u2013969. https:\/\/doi.org\/10.32604\/iasc.2023.027775","DOI":"10.32604\/iasc.2023.027775"},{"key":"19_CR23","first-page":"147","volume":"6","author":"E Dawson","year":"1992","unstructured":"Dawson E, Gustafson H, Pettitt AN (1992) Strict Key Avalanche Criterion. Australas J Comb 6:147\u2013153","journal-title":"Australas J Comb"},{"key":"19_CR24","unstructured":"J. L. Epiphany, \u201cHardware Implementation of LZMA Data Compression Algorithm,\u201d Int. J. Appl. Inf. Syst., no. March 2013, 2013."},{"issue":"1","key":"19_CR25","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.gltp.2021.01.014","volume":"2","author":"F Thabit","year":"2021","unstructured":"Thabit F, Alhomdy S, Jagtap S (2021) Security analysis and performance evaluation of a new lightweight cryptographic algorithm for cloud computing. Glob Transitions Proc 2(1):100\u2013110. https:\/\/doi.org\/10.1016\/j.gltp.2021.01.014","journal-title":"Glob Transitions Proc"},{"key":"19_CR26","doi-asserted-by":"publisher","unstructured":"Gaurav Sharma, Priyanka Goyal, and Shivpratap Singh Kushwah, \u201cImplementation of Modified Playfair CBC Algorithm,\u201d Int. J. Eng. Res., vol. V5, no. 06, pp. 679\u2013684, 2016, doi: https:\/\/doi.org\/10.17577\/ijertv5is060631.","DOI":"10.17577\/ijertv5is060631"},{"issue":"4","key":"19_CR27","doi-asserted-by":"publisher","first-page":"1248","DOI":"10.30534\/ijatcse\/2019\/34842019","volume":"8","author":"RM Marzan","year":"2019","unstructured":"Marzan RM, Sison AM, Medina RP (2019) Randomness analysis on enhanced key security of Playfair cipher algorithm. Int J Adv Trends Comput Sci Eng 8(4):1248\u20131253. https:\/\/doi.org\/10.30534\/ijatcse\/2019\/34842019","journal-title":"Int J Adv Trends Comput Sci Eng"},{"issue":"10","key":"19_CR28","first-page":"1013","volume":"8","author":"RS Villafuerte","year":"2019","unstructured":"Villafuerte RS, Sison AM, Medina RP (2019) An improved 3d playfair cipher key matrix with dual cipher block chaining method. Int J Sci Technol Res 8(10):1013\u20131018","journal-title":"Int J Sci Technol Res"},{"key":"19_CR29","doi-asserted-by":"publisher","unstructured":"J. Rajalakshmi K. Sumangali J. Jayanthi K.Muthulakshmi, Artificial Intelligence with Earthworm Optimization Assisted Waste Management System for Smart Cities. (2023). Global Nest Journal. https:\/\/doi.org\/10.30955\/gnj.004712, vol. 25, no. 4,pp. 190\u2013197.","DOI":"10.30955\/gnj.004712"},{"key":"19_CR30","doi-asserted-by":"publisher","unstructured":"Gopi, R., Sheeba, R., Anguraj, K., Chelladurai, T., Alshahrani, H. M., Nemri, N., & Lamoudan, T. (2023). Intelligent Intrusion Detection System for industrial Internet of things environment. Computer Systems Science and Engineering, 44(2), 1567\u20131582. https:\/\/doi.org\/10.32604\/csse.2023.025216","DOI":"10.32604\/csse.2023.025216"},{"key":"19_CR31","doi-asserted-by":"publisher","unstructured":"Jamuna Rani, M. , & Vasanthanayaki, C. (2023). ELM-Based Shape Adaptive DCT Compression technique for underwater image compression. Computer Systems Science and Engineering, 45(2), 1953\u20131970. https:\/\/doi.org\/10.32604\/csse.2023.028713","DOI":"10.32604\/csse.2023.028713"}],"container-title":["International Journal of Networked and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44227-023-00019-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s44227-023-00019-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s44227-023-00019-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T13:22:00Z","timestamp":1717507320000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s44227-023-00019-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,1]]},"references-count":31,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["19"],"URL":"https:\/\/doi.org\/10.1007\/s44227-023-00019-4","relation":{},"ISSN":["2211-7938","2211-7946"],"issn-type":[{"value":"2211-7938","type":"print"},{"value":"2211-7946","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,1]]},"assertion":[{"value":"29 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 December 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2024","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 competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}