Some Algorithms of Graph Theory in Cryptology
Auparajita Krishnaa
Auparajita Krishnaa, Department of Mathematics and Statistics, Mohan Lal Sukhadia University, Udaipur (Rajasthan) India.
Manuscript received on 27 February 2024 | Revised Manuscript received on 06 March 2024 | Manuscript Accepted on 15 April 2024 | Manuscript published on 30 April 2024 | PP: 9-15 | Volume-4 Issue-1, April 2024 | Retrieval Number: 100.1/ijam.A116704010424 | DOI: 10.54105/ijam.A1167.04010424
Open Access | Editorial and Publishing Policies | Cite | Zenodo | OJS | Indexing and Abstracting
© The Authors. Published by Lattice Science Publication (LSP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: The inventive use of concepts from Graph Theory plays a significant role in hiding the original plaintext, resulting in a significantly safer data transfer. In this work, tree traversal algorithms such as Inorder, Preorder, and Postorder, as well as Kruskal’s algorithm for creating a minimal spanning tree, and the modified graph labelling scheme of graceful labelling, which allows for the repetition of exactly one vertex label for certain graphs, have been employed to create highly hidden Cypher Texts. Encryption and decryption algorithms for all these methods are being presented in this work.
Keywords: Modified Graceful Labelling, Tree Traversal Algorithms, Expression Tree, Modified Ordered Rooted Tree, Basic-Cipher-text, Cipher-Matrix (of different kinds), Encryption-Array.
Scope of the Article: Discrete Mathematics