Various AntimagicLabeled Graphs from Graph Theory for Cryptography Applications

Dharmendra Kumar Gurjar¹ , Auparajita Krishnaa²

Section:Research Paper, Product Type: Journal-Paper
Vol.9 , Issue.3 , pp.11-18, Jun-2022

Online published on Jun 30, 2022

Copyright © Dharmendra Kumar Gurjar, Auparajita Krishnaa . This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
 

View this paper at   Google Scholar | DPI Digital Library

XML View     PDF Download

How to Cite this Paper

Abstract :
Cryptography is a field essentially concerned with sending the original message in a hidden way from the first partyto the second party such that the unwanted third party cannot understand it. For this purpose, various mathematical concepts, especially from Graph Theory have been introduced in the field of Cryptography for the purpose of safer transfer of data. Hiding of the original plain-text message is called encryption resulting in a cipher-text and deciphering the cipher-text to get back the original plain-text is called decryption. Using labeled graphs is an emerging area for cryptographic applications. Antimagic labeling is a type of graph labeling scheme and in this paper, various antimagic labeled graphs have been used for different encryption techniques for an enhanced security in data transfer.

Key-Words / Index Term :
Antimagiclabeling, Centreless Wheel-2, Degree Matrix, Double Wheel, Helm,Laplacian Matrix, Path, Web, XOR operation.

References :
[1] AuparajitaKrishnaa , “An Example Usage of Graph Theory in Other Scientific Fields : On Graph Labeling, Possibilities and Role of Mind/Consciousness”, Chapter, book titled “Graph Theory : Advanced Algorithms and Applications”, IntechOpen, London, UK, pp. 19-44, 2018.
[2] AuparajitaKrishnaa , “Some Applications of Labelled Graphs, International Journal of Mathematics Trends and Technology ,vol. 37number 3, pp. 435-455, 2016.
[3] Ustimenko V.A. ,”On graph based cryptography and symbolic computations”, Serdica Journal of ComputingI, pp. 131-156, 2007
[4]PoojashreeKamble, FirozNagarchi, akchataAkkole, VanashreeKhanapur, bahubaliAkiwate, “ A Dynamic DNA Cryptography Using RSA Algorithm and OTP”, International Journal of Scientific Research in Computer Science and Engineering, vol. 8, issue 4, pp. 78-82, 2020.
[5] Maria Jan, Qamar Shazad, Salman Afsar, “Securing the Cloud Storage by Using Different Algorithms of Cryptography”, International Journal of Scientific Research in Computer Science and Engineering, vol. 10, issue 2, pp. 38-45, 2022.
[6] AuparajitaKrishnaa, Manohar SinghDulawat, “Labelling of Paths”, J. Rajasthan Academy of Physical Sciences, vol . 5, no. 1, pp. 99-104, 2006.
[7] AuparajitaKrishnaa, “On antimagiclabellings of some cycle related graphs”, Journal of Discrete Mathematical Sciences and Cryptography, vol. 15, no. 4 & 5, pp. 225-235, 2012.
[8]AuparajitaKrishnaa,“Formulas and algorithms of antimagiclabelings of some helm related graphs”, Journal of Discrete Mathematical Sciences and Cryptography, vol. 19 no. 2, pp.425-434, 2016.
[9] AuparajitaKrishnaa, Manohar Singh Dulawat, “Algorithms for Inner Magic and Inner AntimagicLabelings for Some Planar Graphs”, Informatica (Lithuania),vol. 17, no.3, pp.393-406, 2006.
[10] AuparajitaKrishnaa, “Inner magic and inner antimagic graphs in cryptography” Journal of Discrete Mathematical Sciences and Cryptography,vol. 22, no. 6,pp. 1057-1066, 2019.
[11] I.W. Sudarsana, S.A. Suryanto, D. Lucianti, N P A P S Putri , “An application of super mean and mean graphs labeling in cryptography system”, J. of Physics, Conference Series, Vol. 1763, The 2nd International Seminar on Sciencce and Technology, 2020 (ISST-2)202016-17, September 2020, Palu, Indonesia. Published under license by IOP Publishing Ltd, 2020.
[12]AuparajitaKrishnaa, “Certain specific graphs in cryptography”, Advances and Applications in Discrete Mathematics”, vol. 26 no. 2, pp, 157-177, 2021.
[13] P. Amudha, A.C. Charles Sagayaraj,A.C. Shantha Sheela, “An Application of Graph Theory in Cryptography”, International Journal of Pure and Applied Mathematics, Vol. 119, no. 13, pp. 375-383, 2018.
[14]Dharmendra KumarGurjar,AuparajitaKrishnaa (2021), “ Labeled Paths in Cyrptography”, Chapter, Book Series, Advances in Mathematics Research, ,Nova Science Publisher, USA., vol. 29, pp. 1-29, 2021
[15]Dharmendra Kumar Gurjar,AuparajitaKrishnaa ,“Complete Graph and Hamiltonian Cycle in Encryption and Decryption”, International Journal of Mathematics Trends and Technology, vol. 67, issue 12, pp. 42-51,2021.
[16] C.L. Liu, Discrete Mathematics, Tata-McGraw Hill, India, 1978.
[17]Dharmendra Kumar Gurjar,AuparajitaKrishnaa (2021), “Lexicographic Labeled Graphs in Cryptography”, Advances and Applications in Discrete Mathematics, vol.27no. 2, pp. 209-232, 2021