Abstract
In cyber security, data encryption is conversion of data from readable form to coded form so that an intended and authorized person can read the original data. Information security has become an essential tool in the present digital world. Applied graph theory plays a crucial role in encryption technique as it has widespread special features equipped with easy and effective representation. The present paper explores a symmetric encryption technique using Hamiltonian circuits of weighted Eulerian graphs, circular bit shift operation, and simple logical XOR operations.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Balakrishnan R, Ranganathan K A textbook of graph theory, 2nd edn. https://doi.org/10.1007/978-1-4614-4529-6
Deo N (2010) Graph theory with applications to engineering and computer science. Prentice Hall
van Steen M (2010) Graph theory and complex networks: an introduction
Ustimenko VA (2018) On algebraic graph theory and non-bijective multivariate maps in cryptography. In: Ganzha M, Maciaszek L, Paprzycki M (eds) Proceedings of the 2018 federated conference on computer science and information systems, ACSIS, vol 15, pp 397–405. https://doi.org/10.15439/2018F204
Tokareva N (2014) Connection between graph theory and cryptography. G2C2: Graphs and groups, cyclic and coverings. Sep 2014, Novosibirsk Russia
Etaiwi WMA (2014) Encryption algorithm using graph theory. J Sci Res Rep 3(19):2519–2527
Amudha P, Charles Sagayaraj AC, Shantha Sheela AC (2018) An application of graph theory in cryptography. Int J Pure Appl Math IJPAM 119(3):375–383
Yamuna M, Gogia M, Sikka A, Khan MJ (2012) Encryption using graph theory and linear algebra. Int J Comput Appl IJCA
Lu S, Manchala D, Ostrovsky R (2008) Visual cryptography on graphs. Cite Seeix COCOON, pp 225–234
Charles DX, Lauter KE, Goren EZ (2009) Cryptographic hash functions from expander graphs. J Cryptology 22:93–113
Costache A, Feigon B, Lauter K, Massierer M, Puskás A (2018) Ramanujan graphs in cryptography. arXiv:1806. 05709V2 [math.NT] 18 Dec 2018
Jo H, Sugiyama S, Yamasaki Y (2021) Ramanujan graphs for post-quantum cryptography. In: Takagi T, Wakayama M, Tanaka K, Kunihiro N, Kimoto K, Ikematsu Y (eds) International symposium on mathematics, quantum theory, and cryptography. Mathematics for Industry, vol 33. Springer, Singapore. https://doi.org/10.1007/978-981-15-5191-8_17
Pradhan D, Som S, Rana A (2008) Cryptography encryption technique using circular bit rotation in binary field. In: 2008 International conference on information processing in sensor networks (ipsn 2008). https://doi.org/10.1109/ICRITO48877.2020.9197845
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Murthy, M.P.R., Lalitha Devi, G., Sarva Lakshmi, S., Suneetha, C. (2023). Data Encryption Basing on the Existence of Eulerian Circuits in a Group of Random Graphs. In: Kaiser, M.S., Xie, J., Rathore, V.S. (eds) Information and Communication Technology for Competitive Strategies (ICTCS 2021). Lecture Notes in Networks and Systems, vol 401. Springer, Singapore. https://doi.org/10.1007/978-981-19-0098-3_69
Download citation
DOI: https://doi.org/10.1007/978-981-19-0098-3_69
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-19-0097-6
Online ISBN: 978-981-19-0098-3
eBook Packages: EngineeringEngineering (R0)