Enhancing cryptographic robustness through error-correcting codes derived from network graphs

Ananthakrishnan, Gayathri; Ghanimi, Hayder M. A.; Pushpa, P.; Rao, T. K. Rama Krishna; Vedaraj, M.; Sengan, Sudhakar; Dadheech, Pankaj

doi:10.47974/JDMSC-2088

Open Access Research Article

Enhancing cryptographic robustness through error-correcting codes derived from network graphs

^*Gayathri AnanthakrishnanCorresponding authorgayathri.a@vit.ac.inSchool of Computer Science Engineering and Information Systems Vellore Institute of TechnologyVellore, Tamil Nadu, 632014, IndiaView full profile → , Hayder M. A. Ghanimihayder.alghanami@uowa.edu.iqDepartment of Information Technology College of Science University of Warith Al-Anbiyaa; Department of Computer Science College of Computer Science and Information Technology University of Kerbala Department of Information Technology College of Science University of Warith Al-AnbiyaaKarbala, 5751, IraqView full profile → , P. Pushpappushpacse88@gmail.comDepartment of Cyber Security Easwari Engineering College Chennai, Tamil Nadu, 600089, IndiaView full profile → , T. K. Rama Krishna Raoramakrishnatk@gmail.comDepartment of Computer Science and Engineering Koneru Lakshmaiah Education FoundationVaddeswaram, Andhra Pradesh, 522502, IndiaView full profile → , M. Vedarajvedaraj84@gmail.comDepartment of Computer Science and Engineering RMD Engineering College Kavaraipettai, Tamil Nadu, 601206, IndiaView full profile → , Sudhakar Sengansudhasengan@gmail.comDepartment of Computer Science and Engineering PSN College of Engineering and Technology Department of Computer Science and Engineering PSN College of Engineering and TechnologyTirunelveli, Tamil Nadu, 627152, IndiaView full profile → , Pankaj Dadheechpankajdadheech777@gmail.comDepartment of Computer Science and Engineering Swami Keshvanand Institute of Technology, Management & Gramothan (SKIT)Department of Computer Science & Engineering Swami Keshvanand Institute of Technology, Management & GramothanJaipur, Rajasthan, 302017, IndiaView full profile →

* Corresponding author · click or hover a name for details

pp. 2155–2167Vol. 27Issue 7October 2024DOI: 10.47974/JDMSC-2088 Crossmark XML

Received:: 06 Mar 2024
Published Online:: 15 Oct 2024
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-2088
Pages:: 2155–2167

Abstract

Secure data transmission is essential for securing sensitive data generated in huge volumes in today’s growing digital era. In today’s growing digital world, secure data transfer is essential for securing private information generated in enormous volumes. Data security strategies, called Cyber Security Systems (CSS), are susceptible to errors and other risks that might damage the data’s integrity. While standard Error-Correcting Codes (ECCs) function well for more standard communication errors, they cannot meet the complex rules of cryptographic functions. In order to boost the CSS size, this article provides a detailed approach that develops ECCs from network graph parameters. The error flexibility, computational speed, and use of bandwidth power of the CSS have been designed to be addressed by the graph-based ECCs. The investigation proposes an approach that analyses network graphs and employs information to develop ECCs, which are then integrated into the existing CSS. Compared with standard models, the one recommended performed more successfully when assessed under a range of error scenarios and cryptanalytic attacks.

Keywords

Mathematical modeling Ordinary differential equations A duopoly economy Market share

Subject Classifications

34A06

References

[1] R. A. Teubner and J. Stockhinger, “Literature review: Understanding information systems strategy in the digital age,” The Journal of Strategic Information Systems, vol. 29, no. 4, pp. 101642 (2020).
[2] A. I. Newaz, M. H. A. Rahman, M. A. M. T. Z. Rahman, and A. R. A. Rahman, “A survey on security and privacy issues in modern healthcare systems: Attacks and defenses,” ACM Transactions on Computing for Healthcare, vol. 2, no. 3, pp. 1-44 (2021).
[3] J. P. A. Yaacoub, K. M. A. Al-Muhtadi, and M. S. H. Al-Bayati, “Cyber-physical systems security: Limitations, issues and future trends,” Microprocessors and Microsystems, vol. 77, no. 103201 (2020).
[4] M. A. Ghanimi, R. Venkatesan, and R. R. D. S. Shivaraj, “Chebyshev polynomial approximation in CNN for zero-knowledge encrypted data analysis,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 2-A, pp. 203–214 (2024).
[5] P. Vidya Sagar, S. R. Raghunathan, and M. A. R. K. Marimuthu, “Secure multi-party computation in deep learning: Enhancing privacy in distributed neural networks,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 2-A, pp. 249–259 (2024).
[6] S. H. Nowfal, R. A. R. Alqurashi, and Y. A. N. B. Alghamdi, “Advancing viscoelastic material modeling: Tackling time-dependent behavior with fractional calculus,” Journal of Interdisciplinary Mathematics, vol. 27, no. 2, pp. 307–316 (2024).
[7] P. Vidya Sagar, S. R. Raghunathan, and M. A. R. K. Marimuthu, “Utilizing stochastic differential equations and random forest for precision forecasting in stock market dynamics,” Journal of Interdisciplinary Mathematics, vol. 27, no. 2, pp. 285–298 (2024).
[8] G. R. K. Rao, S. R. Raghunathan, M. A. R. K. Marimuthu, and A. K. S. Ravi, “Enhanced security in federated learning by integrating homomorphic encryption for privacy-protected, collaborative model training,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 2-A, pp. 361–370 (2024).
[9] K. Raguru Jaya, P. Vidya Sagar, and S. R. Raghunathan, “Security and privacy concerns in social networks: Mathematically modified metaheuristic-based approach,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 2-A, pp. 371–382 (2024).
[10] S. Sudhakar and S. Chenthur Pandian, “Hybrid cluster-based geographical routing protocol to mitigate malicious nodes in mobile ad hoc network,” International Journal of Ad Hoc and Ubiquitous Computing, vol. 21, no. 4, pp. 224–236 (2016).

Views: 279Downloads: 6Citations: 0