Applying Graph Theory to Secure Data by Cryptography

Author
Dr. Gurusharan Kaur, Dr. Namrata Tripathi
Keywords
Cryptography; Substitution; Transposition; Adjacent Matrix; Sparse; Symmetric; Asymmetric.
Abstract
Graph Theory is one of the significant and important areas in Mathematics, which is used in Network Security. Cryptography is art of science to achieving security by encoding message to make it non-readable (secretive) to unintended users. Many techniques are presents to encrypt plain text and convert it to the cipher text [2]. Any cryptographic scheme is secure if and only if it is unbreakable in reasonable time, using feasible resources in spite of the intruder’s being aware of the encryption and decryption algorithm and size of the key. In the proposed algorithm, adjacent matrix of graph can be used to obtain key for encryption and decryption which is safer compared to other keys.
References
[1] Atul Kahate (2009)Cryptography and Network security, 2nd Edition , McGraw Hill
[2] “Enhancing security of caesar cipher by Double colummar transposition method” by Vinod Saroha, Suman Mor and Anurage Dagar, International journal of advanced research in computer science and software engineering, vol. 2, issue 10, Oct. 2012.
[3] Stalling. W (1999), Cryptography and Network security, 2nd Edition, Prentice Hall
[4] William stalling “Network security Essentials (Application and standards)”, Pearson Education, 2004
[5] www.securnet.biz/Ebooks/Network_Security.pdf‎ , Accessed on 2nd October 2020.
Received : 14 October 2020
Accepted : 12 February 2021
Published : 23 February 2021
DOI: 10.30726/ijlca/v8.i1.2020.81001

Download “Graph Theory to Secure Data by Cryptography” Graph-Theory-to-Secure-Data-by-Cryptography.pdf – Downloaded 20 times – 158 KB