Complete Graph and Hamiltonian Cycle in Encryption and Decryption

Dharmendra Kumar Gurjar; Auparajita Krishnaa

doi:https://doi.org/10.14445/22315373/IJMTT-V67I12P507

International Journal of Mathematics Trends and Technology

Research Article | Open Access | Download PDF

Volume 67 | Issue 12 | Year 2021 | Article Id. IJMTT-V67I12P507 | DOI : https://doi.org/10.14445/22315373/IJMTT-V67I12P507

Complete Graph and Hamiltonian Cycle in Encryption and Decryption

Dharmendra Kumar Gurjar, Auparajita Krishnaa

Abstract

In recent times, Cryptography has becomes a significant area for research due to the vast transfer of information including the need for maintaining secrecy. Various encryption techniques are developed and used for securing the transferred data between two or more sources to hide the messages being sent. This paper involves an encryption technique for encrypting the message with the use of Complete Graph and a Cycle to generate a Cipher text using 2 keys, one of them is formed by the use of Hamiltonian Circuit. The decryption algorithm is also provided for the same.

Keywords

Complete Graph, Cycle, Hamiltonian Cycle, Encryption, Decryption, Cipher text, Complete Graph Matrix.

References

[1] Krishnaa A., An Example Usage of Graph Theory in Other Scientific Fields: On Graph Labeling, Possibilities and Role of Mind/C onsciousness, Chapter in the book titled Graph Theory : Advanced Algorithms and Applications, IntechOpen, London, UK (2018).
[2] Krishnaa A. and Dulawat M.S., Algorithms for Inner Magic and Inner Antimagic Labelings for Some Planar Graphs, Informatica (Lithuania), 17(3) (2006) 393-406.
[3] Krishnaa A., Inner magic and inner antimagic graphs in cryptography Journal of Discrete Mathematical Sciences and Cryptography, 22(6) (2019) 1057-1066.
[4] I.W. Sudarsana, S.A. Suryanto, D. Lucianti and N P A P S Putri, An application of super mean and mean graphs labeling in cryptography system, J. of Physics, Conference Series, 1763, The 2nd International Seminar on Sciencce and Technology, Palu, Indonesia. Published under license by IOP Publishing Ltd (2020).
[5] Ustimenko V.A., On graph based cryptography and symbolic computations, Serdica Journal of Computing I, (2007) 131-156.
[6] Krishnaa A., Certain specific graphs in cryptography, Advances and Applications in Discrete Mathematics, 26(2) (2021) 157-177.
[7] Shamir Adi, Random graphs in cryptography, The Weizman Institute, Israel, The Onassis Foundation Science Lecture Series, 28 (2010).
[8] Perera P.A.S. and Wijesiri G.S., Encryption and decryption in symmetric key cryptography using graph theory, (2021).
[9] Etaiwi W. M. A., Encryption Algorithm using Graph Theory. Journal of Scientific Research and Reports. 3(19) (2014) 2519-2527.
[10] Yamuna M. and Karthika K., Data transfer using bipartite Graphs. International Journal of Advance Research in Science and Engineering (IJARSE), 4(2) (2015).
[11] Krishnaa A., Some Applications of Labelled Graphs, International Journal of Mathematics Trends and Technology, 37(3) (2016).

Citation :

Dharmendra Kumar Gurjar, Auparajita Krishnaa, "Complete Graph and Hamiltonian Cycle in Encryption and Decryption," International Journal of Mathematics Trends and Technology (IJMTT), vol. 67, no. 12, pp. 62-71, 2021. Crossref, https://doi.org/10.14445/22315373/IJMTT-V67I12P507