Encryption and decryption of a word into weighted graph using super-edge anti-magic total labeling of Bi-star graph

Jegan, R.; Vijayakumar, P.; Ambethkumar, V. D.; Vijay, Pa; Onyema, Edeh Michael

doi:10.47974/JDMSC-1752

Open Access Research Article

Encryption and decryption of a word into weighted graph using super-edge anti-magic total labeling of Bi-star graph

^*R. JeganCorresponding authorrjch12571@gmail.comDepartment of Mathematics GIET University; Panimalar Engineering CollegeDepartment of Mathematics GIET UniversityGunupur, Odisha, 765 022, IndiaView full profile → , P. Vijayakumarvijaykumar@giet.eduDepartment of Mathematics GIET UniversityGunupur, Odisha, 765022, IndiaView full profile → , V. D. Ambethkumardr.vdambethkumar@gmail.comDepartment of Computer Engineering Mizoram UniversityAizwal, Mizoram, 796004, IndiaView full profile → , Pa Vijayvijayparthiban28092002@gmail.comDepartment of Artificial Intelligence and Data Science Panimalar Engineering CollegeChennai, Tamil Nadu, 600123, IndiaView full profile → , Edeh Michael Onyemamichael.edeh@ccu.edu.ngDepartment of Mathematics and Computer Science Mathematics and Computer Science Coal City UniversityEnugu, NigeriaView full profile →

* Corresponding author · click or hover a name for details

pp. 1355–1365Vol. 26Issue 5August 2023DOI: 10.47974/JDMSC-1752 Crossmark XML

Published Online:: 09 Sep 2023
Article type:: Research Article
Language:: EN
Article no.:: JDMSC-1752
Pages:: 1355–1365

Abstract

Graph labeling is an important topic in Graph theory, a branch of Mathematics, having applications in the field of Networks, radio astronomy and cryptography etc. In most of encryption algorithms, words are encrypted as words. But our implementation is based on the algorithm that encrypts words into numbers, with the help of an edge weighted graph. Mapping of certain positive integers to graph elements in such a way that weights of all edges computed as, sum of the labels of all graph elements, are distinct is termed as Antimagic labeling In this paper, we present an algorithm that encrypts words into edge weighted graphs using super-edge antimagic total labeling of Bi-star graph and illustrate with an example.

Keywords

Super-edge antimagic labeling Weighted graph Encryption decryption Bi-star graph RSA algorithm

Subject Classifications

68M2505C22

References

[1] P.Amudha, J.Jayapriya, et. al., An Algorithmic Approach for Encryption using Graph Labeling J. Phys.: Conf. Ser, 1770 012072 (2021).
[2] Aiden A. Bruen; Mario A. Forcinito; et. al., “The Fundamentals of Modern Cryptography”.
[3] Adesh Kumari,M. Yahya Abbasi,Vinod Kumar Akber Ali Khan, A secure user authentication protocol using elliptic curve cryptography, Journal of Discrete Mathematical Sciences and Cryptography, 22:4, 521-530.
[4] Sampathkumar. E, “On duplicate graphs”, Journal of the Indian Math. Soc. 37, 285-293 (1973).
[5] PK Dewi et al., On super (a, d)-edge-antimagic total labeling of Möbiusladder, Journal of Physics Conference Series,. 1040 012019
[6] I W Sudarsana, S A Suryanto, D Lusianti and N P A P S Putri An application of super mean and magic graphs labeling on cryptography system, J. Phys.: Conf. Ser. 1763 012052, IOP Publishing, P1-18 (2020).
[7] Wael Mohammed Al Etaiwi, Encryption Algorithm Using Graph Theory, Journal of Scientific Research and Reports, 3(19), 2519-2527 (Jan 2014).
[8] William Stallings, “Cryptography and Network security Principles and Practices”, Pearson/PHI, Seventh Edition (2017).
[9] R. Aragona, R. Civino, N. Gavioli & M. Pugliese. An authenticated key scheme over elliptic curves for topological networks, Journal of Discrete Mathematical Sciences and Cryptography, 25:8, 2429-2448 (2022), DOI: 10.1080/09720529.2020.1866298.
[10] Wing Loon Chee. Public key cryptography based on Moufang loops, Journal of Discrete Mathematical Sciences and Cryptography, 25:8, 2411-2427 (2022), DOI: 10.1080/09720529.2020.1864933.

Views: 553Downloads: 9Citations: 6