Encrypting Numbers through Square Grid Graphs
About this article
DOI:
https://doi.org/10.14419/ijet.v7i4.10.26121Keywords:
encryption, decryption, digraph, , magic, labeling.Abstract
Cryptography emphasizes the mathematics behind the theory of public key cryptosystems and digital signature schemes. Encryption is essential for ensured and trusted delivery of sensitive information whereas the decryption is the process of decoding the data which has been encrypted in to a secret format. An authorized user can only decrypt data since decryption requires a secret key or password. There are several methods to encrypt the numbers. In this paper, a combinatorial technique to encrypt and decrypt numbers through labeled strong face of a square grid graph using residue class of Z3 has been investigated.
References
Baskar Babujee, J. (2004), “On Edge Bimagic Labeling. Journal of Combinatorics, Information & System Sciences”, 28-29(1-4), 239-244.
Baskar Babujee, J., & Babitha, S. (2012), “Encrypting and Decrypt-ing Number using Labeled Graphs”, European Journal of Scientific Research, 75(1), 1424.
Baskar Babujee, J., & Vishnupriya, V. (2017), “Encryption Num-bers using Pair Labeling in Path Graphs”, International Journal of Pure and Applied Mathematics, 114(2), 249-259.
Gallian, J.A. (2017), A dynamic survey of graph labeling, The Elec-tronic Journal of Combinatorics, #DS6.
Mohammed Ali Ahmed & Baskar Babujee, J. (2017), “Encryption through Labeled Graphs Using Strong Face Bimagic Labeling” , International Mathematical Forum, 12(4), 151-158.
View more references (3)
Rosa. (1966), “On certain valuations of vertices of a graph”, Theory of Graphs Internet Symposium, Rome, Gordon and Breach, NY (1967), Dunod, Paris, 349355.
Telang, S.G. (1996). Number Theory, Tata McGraw-Hill Publishing Company Limited.
Wallis, W.D. (2001). Magic graphs, Birkhauser.