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

Indian Journal of Science and Technology


Indian Journal of Science and Technology

Year: 2020, Volume: 13, Issue: 44, Pages: 4483-4489

Original Article

Cryptosystem using double vertex graph

Received Date:28 September 2020, Accepted Date:04 November 2020, Published Date:15 December 2020


Background/Objective: The Coronavirus Covid-19 has affected almost all the countries and millions of people got infected and more deaths have been reported everywhere. The uncertainty and fear created by the pandemic can be used by hackers to steal the data from both private and public systems. Hence, there is an urgent need to improve the security of the systems. This can be done only by building a strong cryptosystem. So many researchers started embedding different topics of mathematics like algebra, number theory, and so on in cryptography to keep the system, safe and secure. In this study, a cryptosystem using graph theory has been attempted, to strengthen the security of the system. Method: A new graph is constructed from the given graph, known as a double vertex graph. The edge labeling of this double vertex graph is used in encryption and decryption. Findings: A new cryptosystem using the amalgamation of the path, its double vertex graph and edge labeling has been proposed. From the double vertex graph of a path, we have given a method to find the original path. To hack such an encrypted key, the knowledge of graph theory is important, which makes the system stronger. Applications:The one-word encryption method will be useful in every security system that needs a password for secure communication or storage or authentication.

Keywords: Double vertex graphs; path; adjacency matrix; encryption; cryptography


  1. Stallings W. Cryptography and Network Security (6). Pearson Education Inc. 2014.
  2. Priyadarsini PLK. A survey on some applications of graph theory in cryptography. Journal of Discrete Mathematical Sciences and Cryptography. 2015;18(3):209–217. Available from: https://dx.doi.org/10.1080/09720529.2013.878819
  3. Yamuna M, Gogia M. Jazib Hayat khan “Encryption Using Graph Theory and Linear Algebra”. International Journal of Computer Application. 2012;5:102–107.
  4. Yamuna M, Karthika K. Data Transfer using Bipartite Graphs. International Journal of Advance Research in Science and Engineering. 2015;4:128–131.
  5. Etaiwi W. Encryption algorithm using graph theory. Journal of Scientific Research and Reports. 2014;3(19):2519–2527. Available from: https://dx.doi.org/10.9734/jsrr/2014/11804
  6. Cusack B, Chapman E. Using graphic methods to challenge cryptographic performance. In: Proceedings of 14th Australian Information Security Management Conference. Perth, Western Australia. Edith Cowan University. p. 30–36.
  7. Harary F. Graph Theory. Narosa Publishing House. 1988.
  8. Alavi Y, Behzad M, Erdos P, Lick DR. Double vertex graphs. Journal of Combinatorics, Information and System Sciences. 1991;16:37–50. Available from: https://doi.org/10.1007/978-1-4614-7254-4
  9. Beaula C, Venugopal P, Padmapriya N. Graph distance of vertices in double vertex graphs. International Journal of Pure and Applied Mathematics. 2018;18:343–351.


© 2020 Beaula & Venugopal.This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Published By Indian Society for Education and Environment (iSee)


Subscribe now for latest articles and news.