• P-ISSN 0974-6846 E-ISSN 0974-5645

Indian Journal of Science and Technology

Article

• VIEWS 978
• PDF 229

Indian Journal of Science and Technology

Year: 2022, Volume: 15, Issue: 44, Pages: 2351-2355

Original Article

A Hamiltonian Path-Based Enciphering Technique with the use of a Self-Invertible Key Matrix

Received Date:14 September 2022, Accepted Date:07 October 2022, Published Date:23 November 2022

Abstract

Objective: The symmetric encryption technique is one of the most important fields for securing communications between people. In order to produce complex ciphertext, we are introducing the new enciphering technique with the help of the Hamiltonian path, a self-invertible key matrix for encryption and decryption. Methods: There are many kinds of symmetric enciphering methods, like the Caesar Cipher, Atbash Cipher, Hill Cipher, etc. All these methods use a common key for encryption, and while decrypting the inverse of that matrix should be found, it is also too hard to share the common key. To reduce this terminology, we proposed the novel enciphering method with the help of a self-invertible key matrix. Findings: We are using the generated selfinvertible key matrix as a key matrix; the degree of the self-invertible matrix is even. If our graph does not form an even-degree adjacency matrix, then we have to make it into an even-degree adjacency matrix by adding dummy edges. Novelty: As we are using a self-invertible matrix as a key matrix, we do not need to compute the inverse of the key matrix for the process of decryption. This helps us to reduce the complexity of finding the inverse while decrypting the original message.

Keywords: Graph Theory Encryption; Hill Cipher; Hamiltonian Path; Adjacency Matrix; Self Invertible Matrix

References

1. Dixit U. Cryptography a Graph theory approach. International Journal of Advance Research in Science and Engineering. 2017;6(01).
2. Mahmoud W, Etaiwi AI. Encryption algorithm using Graph theory. Journal of Scientific Research & Reports. 2014;3(19):2519–2527. Available from: https://doi:10.9734/JSRR/2014/11804
3. Yamuna M, Gogia M, Sikka A, Khan MJH. Encryption Using Graph Theory and Linear Algebra. International Journal of Computer Application. 2012;5(2):2250–1797.
4. Nandhini R, Maheswari V, Balaji V, Graph. Theory Approach on Cryptography. 2018. Available from: https://doi.org/10.26524/jcm32
5. Amudha P, Jayapriya J, Gowri J. An Algorithmic Approach for Encryption using Graph Labeling. Journal of Physics: Conference Series. 2021;1770(1):012072. Available from: https://doi:0.1088/1742-6596/1770/1/012072
6. Acharya B, Rath GS, Patra SK, Panigrahy S. A Novel method of generating self-invertible matrix for Hill Cipher Algorithm. International Journal of Security . 2007;p. 14–21. Available from: https://www.cscjournals.org/library/manuscriptinfo.php?mc=IJS-2
7. Mohan P, Rajendran K, AR. A, An Encryption Technique using a Complete graph with a Self-invertible matrix. Journal of Algebraic statistics. 2022;13(3):1821–1826. Available from: https://publishoa.com/index.php/journal/article/view/816