Colored Star Graph for Encryption Schemes
DOI:
https://doi.org/10.58564/IJCCN.1.1.2025.5Keywords:
Cryptography, SE scheme, Graph theory, CSG, Security.Abstract
Graph theory as an essential area of mathematics for several applications. It uses for modeling many real life problems in various specializations, in engineering , computer science, banking, industry, transportation, as well as in cryptography and security to solve them. In this work, alternative symmetric encryption (SE) scheme are proposed based on new formula of shared secret key (SSK). This key is generated using the coloring star graph (CSG). The ciphertext of the plaintext, that is an English word or English sentence, is computed and sent in the channel as the CSG. The attackers here with the proposed SE scheme facing the difficulty to recover the secret key. New experimental result is presented with small parameters as a study case. So, the security of the proposed CSG-SE scheme depending on how to generate the secret key. Thus, the CSG-SE scheme considers as more secure SE scheme in compare with previous ones for communication.
References
[1] L. N. M. Tawfiq, and I. N. Abood, “Persons Camp Using Interpolation Method ,” Journal of Physics: Conference Series, Vol. 1003, No. 1, 2018, pp. 012055.
[2] W. A. Shukur, K. J. Khalid, and K. Q. Luheb, “A Proposed Hybrid Text Cryptographic Method Using Circular Queue,” IJCET, Vol. 9, No. 7, 2018, pp. 1123-1132.
[3] S. J. Yaqoob, and R. K. K. Ajeena, “The Multi-Primes Lanstra's Elliptic Curve Factorization Algorithm,” In 2020 6th International Engineering Conference “Sustainable Technology and Development"(IEC), 2020, pp. 141-145.
[4] Q. M. Luhaib, and R. K. K. Ajeena, “Elliptic curve matrices over group ring to improve elliptic curve–discrete logarithm cryptosystems,” Journal of Discrete Mathematical Sciences & Cryptography, Vol. 26, No. 6, 2023, pp.1699 – 1704.
[5] R. K. K. Ajeena, and H. Kamarulhaili, “On the distribution of scalar k for elliptic scalar multiplication,” AIP Conference Proceedings, Vol. 1682, No. 1, 2015.
[6] M. Amara, and A. Siad, “Elliptic curve cryptography and its applications,” In International workshop on systems, signal processing and their applications, WOSSPA (pp. 247-250), 2011.
[7] T. Fujita, “Analytical study on Ultrafilter in Digraph: Directed Tangle and Directed Ultrafilter,” Asian Research Journal of Mathematics 21, No. 5 (2025), pp. 132-146.
[8] T. Fujita, “Linear-branch-decomposition of digraph,” Theory and Applications of Graphs, submitted (2025).
[9] P. Amudha, A. C. Sagayaraj, and A. S. Sheela, “An application of graph theory in cryptography,” International Journal of Pure and Applied Mathematics, Vol. 119, No. 13, 2018, pp. 375-383.
[10] P. Amudha, A. C. Sagayaraj, and A. S. Sheela, “An application of graph theory in cryptography,” International Journal of Pure and Applied Mathematics, Vol. 119, No. 13, 2018, pp. 375-383.
[11] R. Nandhini, V. Maheswari, and V. Balaji, “A Graph Theory Approach on Cryptography,” Journal of Computational Mathematica, Vol. 2, No. 1, 2018, pp. 97-104.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2025 Ruma Kareem K. Ajeena , Satea Hikmat Alnajjar, Sabah Mahmoud K. Al-Masoudi, Atheer Jawad Kadhim
This work is licensed under a Creative Commons Attribution 4.0 International License.
