Efficient Graph Algorithms in Securing Communication Networks

This paper presents three novel encryption and decryption schemes based on graph theory that aim to improve security and error resistance in communication networks. The novelty of this work lies in the application of complete bipartite graphs in two of the schemes and the Cartesian product of graphs...

Full description

Saved in:
Bibliographic Details
Published in:Symmetry (Basel) Vol. 16; no. 10; p. 1269
Main Authors: Bokhary, Syed, Kharal, Athar, Samman, Fathia, Dalam, Mhassen, Gargouri, Ameni
Format: Journal Article
Language:English
Published: Basel MDPI AG 01.10.2024
Subjects:
Algorithms
Codes
Communication networks
Cryptography
Data encryption
Data security
Encryption
Graph theory
Graphical representations
Graphs
Innovations
Network security
Safety and security measures
Security software
Iran
ISSN:2073-8994, 2073-8994
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents three novel encryption and decryption schemes based on graph theory that aim to improve security and error resistance in communication networks. The novelty of this work lies in the application of complete bipartite graphs in two of the schemes and the Cartesian product of graphs in the third, representing a unique approach to cryptographic algorithm development. Unlike traditional cryptographic methods, these graph-based schemes use structural properties of graphs to achieve robust encryption, providing greater resistance to attacks and corruption. Each scheme is illustrated with detailed examples that show how the algorithms can be successfully implemented. The algorithms are written in standard mathematical notation, making them adaptable for machine implementation and scalable for real-world use. The schemes are also rigorously analyzed and compared in terms of their temporal and spatial complexities, using Big O notation. This comprehensive evaluation focuses on their effectiveness, providing valuable insights into their potential for secure communication in modern networks.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2073-8994
2073-8994
DOI:10.3390/sym16101269