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...
Saved in:
| Published in: | Symmetry (Basel) Vol. 16; no. 10; p. 1269 |
|---|---|
| Main Authors: | , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Basel
MDPI AG
01.10.2024
|
| Subjects: | |
| ISSN: | 2073-8994, 2073-8994 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!