Encryption scheme of modified Caesar cipher using bipartite graph
*Koushani RoyCorresponding authorkoushani1.roy@stu.adamasuniversity.ac.inDepartment of MathematicsBarasat - Barrackpore RoadAdamas UniversityJagannathpur, Kolkata, 700126, IndiaView full profile → , Supriyo Mazumdersupriyo88@gmail.comsupriyo.mazumder@adamasuniversity.ac.inDepartment of MathematicsBarasat - Barrackpore RoadAdamas UniversityJagannathpur, Kolkata, 700126, IndiaView full profile →
* Corresponding author · click or hover a name for details
- Received:
- 19 Jun 2024
- Published Online:
- 23 May 2025
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIOS-1880
- Pages:
- 1645–1658
Abstract
Keywords
Subject Classifications
References
[1] S. Agarwal, “Prime weighted graph in cryptographic system for secure communication,” Int. J. Pure Appl. Math., vol. 105, pp. 325-338 (2015).
[2] P. Amudha, A. C. Charles Sagayaraj, and A. C. Shantha Sheela, “An application of graph theory in cryptography,” Int. J. Pure Appl. Math., vol. 119, no. 13, pp. 375-383 (2018).
[3] H. Anwar and Z. Shams, “Algorithms of encryption using graph theory,” Math. Sci. Appl., vol. 2, pp. 73-85 (2023).
[4] B. Charles, “Cryptosystem using double vertex graph,” Indian J. Sci. Technol., vol. 13, pp. 4483-4489 (2020).
[5] B. Charles, P. Venugopal, and B. Praba, “Block encryption and decryption of a sentence using decomposition of the Turan graph,” J. Math., vol. 2023, Article ID 7588535, 9 pages (2023).
[6] V. M. Chandrasekaran, B. Praba, A. Manimaran, and G. Kailash, “Data transfer using complete bipartite graph,” in IOP Conf. Ser. Mater. Sci. Eng., vol. 263 (2017).
[7] N. Deo, Graph Theory with Applications to Engineering and Computer Science, Prentice Hall (2010).
[8] U. Dixit, “Cryptography: A graph theory approach,” Int. J. Adv. Res. Sci. Eng., vol. 6, no. 1 (2017).
[9] W. Etaiwi, “Encryption algorithm using graph theory,” J. Sci. Res. Rep., vol. 3, pp. 2519-2527 (2014).
[10] D. Gurjar and A. Krishnaa, “Labeled paths in cryptography,” Adv. Math. Res. (2021).
11] H. R. Medini, S. Dsouza, D. C. Nayak, and P. Bhat, “Encoding and decoding of messages using graph labeling and complement of a graph,” Global Stoch. Anal., vol. 11, no. 1 (2024).
[12] B. Joseph and B. Thomas, “Malaya Journal of Matematik,” Malaya J. Matematik, vol. 9, no. 1, pp. 470-473 (2021).
[13] P. Kedia and S. Agarwal, “Encryption using Venn diagrams and graph,” Int. J. Adv. Comput. Technol., vol. 4, pp. 94-99 (2015).
[14] R. Kuppan, L. Shobana, and I. N. Cangl, “Encrypting and decrypting algorithms using strong face graph of a tree,” Int. J. Comput. Math. Comput. Syst. Theory, vol. 5, pp. 225-233 (2020).
[15] B. Ni, R. Qazi, S. Rehman, and G. Farid, “Some graph-based encryption schemes,” J. Math., vol. 2021, pp. 1-8 (2021).
[16] A. Paszkiewicz, A. Górska, K. Górski, Z. Kotulski, K. Kulesza, and J. Szczepański, “Proposals of graph-based ciphers, theory and implementations,” (2001).
[17] S. Perera and S. Wijesiri, “Encryption and decryption algorithms in symmetric key cryptography using graph theory,” Psychol. Educ., vol. 58, no. 1, pp. 3420-3427 (2021).
[18] P. L. K. Priyadarsini, “A survey on some applications of graph theory in cryptography,” J. Discrete Math. Sci. Cryptogr., vol. 18, no. 3, pp. 209-217 (2015).
[19] A. Razaq, G. Alhamzi, S. Abbas, M. Ahmad, and A. Razzaque, “Secure communication through reliable S-box design: A proposed approach using coset graphs and matrix operations,” Heliyon, vol. 9, no. 5, May 2 (2023).
[20] D. Sensarma and S. Sarma, “Application of graphs in security,” Int. J. Innov. Technol. Explor. Eng., vol. 8, pp. 2273-2279 (2019).
[21] C. R. Sharmila and S. Meenakshi, “A fuzzy graph theory approach to symmetric key cryptography,” J. Propuls. Technol., vol. 45, no. 1, pp. 467-477 (2024).
[22] W. Stallings, Cryptography and Network Security, 7th ed., Pearson Education Pvt. Ltd., Global Edition (2017).
[23] N. Tokareva, “Connections between graph theory and cryptography,” G2C2: Graphs and Groups, Cycles and Coverings, Novosibirsk, Russia, Sept. 24-26 (2014).
[24] V. Ustimenko, “On graph-based cryptography and symbolic computations,” Serdica J. Comput., vol. 1 (2007).
[25] M. Yamuna, M. Gogia, A. Sikka, and Md. J. H. Khan, “Encryption using graph theory and linear algebra,” Int. J. Comput. Appl., vol. 5, no. 2, Oct. (2012).
[26] M. Yamuna and K. Karthika, “Data transfer using bipartite graphs,” Int. J. Adv. Res. Sci. Eng., vol. 4, no. 2, Feb. (2015).
[27] P. S. K. Reddy and P. S. Hemavathi, “Generalization of bipartite graphs,” J. Discrete Math. Sci. Cryptogr., vol. 23, no. 3, pp. 787-793 (2020).
[28] S. A. Swadi and A. A. Najim, “The generalized k-connectivity of equally complete bipartite graphs and their line graphs,” J. Discrete Math. Sci. Cryptogr., vol. 27, no. 5, pp. 1567-1573 (2024).
