Exploring secure communication through artistic graph creation

Medini, H. R.; D’Souza, Sabitha; Nayak, C. Devadas; Bhat, Pradeep G.

doi:10.47974/JDMSC-2101

Open Access Research Article

Exploring secure communication through artistic graph creation

H. R. Medinimedinihr@gmail.comDepartment of MathematicsManipal Institute of TechnologyManipal Academy of Higher EducationManipal, Karnataka, 576104, IndiaView full profile → , ^*Sabitha D’SouzaCorresponding authorsabitha.dsouza@manipal.eduDepartment of MathematicsManipal Institute of TechnologyManipal Academy of Higher EducationManipal, Karnataka, 576104, IndiaView full profile → , C. Devadas Nayakdevadas.nc@manipal.eduDepartment of MathematicsManipal Institute of TechnologyManipal Academy of Higher EducationManipal, Karnataka, 576104, IndiaView full profile → , Pradeep G. Bhatpg.bhat@manipal.eduDepartment of MathematicsManipal Institute of TechnologyManipal Academy of Higher EducationManipal, Karnataka, 576104, IndiaView full profile →

* Corresponding author · click or hover a name for details

pp. 143–159Vol. 28Issue 1February 2025DOI: 10.47974/JDMSC-2101 Crossmark XML

Received:: 09 Jan 2024
Published Online:: 28 Feb 2025
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-2101
Pages:: 143–159

Abstract

Creating art through mathematics can provide a unique way to communicate complex ideas, patterns and concepts in an aesthetically pleasing manner. Translating complex data into a visual representation is a valuable way to communicate information effectively. Also, secured communication is a highly challenging task in the contemporary world. There will always be a continuous search for better algorithms to prevent data from breaching. This paper aims to transform each word into unique artistic graphs, facilitating communication through visually appealing representation. A novel algorithmic art approach is introduced to communicate securely. Graph labeling and generalized complement of a graph are used in encryption and decryption. The proposed algorithm uses vertex even mean labeling and k(i)-complement of a graph to convert plaintext into cipher graph and vice versa. This algorithm is a symmetric key algorithm as both encryption and decryption use the same cryptographic key and is applicable for all plaintexts including special characters.

Keywords

Encryption and decryption Communication Message Graph labeling Generalized complement

Subject Classifications

05C7805C8505C9090C35

References

[1] A. Rosa, “On certain valuations of the vertices of a graph,” Theory of Graphs (Internat. Symposium, Rome), pp. 349-355 (1966).
[2] A. Sangwan, B. Keswani and A. Sharma, “Optimization of secure communication channel over the volunteer cloud and cloud computing,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 24, no. 8, pp. 2257-2266 (2021).
[3] E. Sampathkumar and L. Pushpalatha, “Complement of a graph: A generalization,” Graphs and Combinatorics, vol. 14, no. 4, pp. 377-392 (1998).
[4] E. Sampathkumar, L. Pushpalatha, C. V. Venkatachalam and P. Bhat, “Generalized complements of a graph,” Indian Journal of Pure and Applied Mathematics, vol. 29, no. 6, pp. 625-639 (1998).
[5] J. A. Gallian, “A dynamic survey of graph labeling,” Electronic Journal of Combinatorics, vol. 1 (DynamicSurveys), pp. DS6 (2018).
[6] H. R. Medini, S. D’Souza, D. Nayak C and P. G. Bhat, “Encoding and decoding of messages using graph labeling and complement of a graph,” Global and Stochastic Analysis, vol. 11, no. 1, pp. 1-13 (2024).
[7] H. R. Medini, S. D’Souza, D. Nayak C and P. G. Bhat, “Multifaceted coding of messages using the concepts of graph theory,” IAENG International Journal of Computer Science, vol. 51, no. 2, pp. 143-153 (2024).
[8] N. Revathi, “Vertex odd mean and even mean labeling of some graphs,” IOSR Journal of Mathematics, vol. 11, no. 2, pp. 70-74 (2015).
[9] P. L. K. Priyadarsini, “A survey on some applications of graph theory in cryptography,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 18, no. 3, pp. 209-217 (2015).
[10] S. Somasundaram and R. Ponraj, “Mean labelings of graphs,” National Academy Science Letters, vol. 26, no. 7-8, pp. 210-213 (2003).
[11] V. Kapoor and R. Gupta, “Hybrid symmetric cryptography approach for secure communication in web application,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 24, no. 5, pp. 1179-1187 (2021).

Views: 264Downloads: 102Citations: 0