An encryption technique using the adjacency matrices of certain graphs with a self-invertible key matrix
The most important approaches for safeguarding our communications and data nowadays are message encryption techniques. The use of the internet and network communications has increased the pace of message encryption technology development. Sharing sensitive, private messages through unsecured network...
Main Authors: | Mohan P., Rajendran K., Rajesh A. |
---|---|
Format: | Article |
Language: | English |
Published: |
EDP Sciences
2023-01-01
|
Series: | E3S Web of Conferences |
Online Access: | https://www.e3s-conferences.org/articles/e3sconf/pdf/2023/13/e3sconf_ersme2023_01108.pdf |
Similar Items
-
Anti-Adjacency Matrices of Certain Graphs Derived from Some Graph Operations
by: Manju V N, et al.
Published: (2023-12-01) -
Eigenpairs of adjacency matrices of balanced signed graphs
by: Chen Mei-Qin
Published: (2024-07-01) -
Matrix Mappings on the Domains of Invertible Matrices
by: Muhammed Altun
Published: (2013-01-01) -
On the inverse of the adjacency matrix of a graph
by: Farrugia Alexander, et al.
Published: (2013-11-01) -
Energy of Certain Classes of Graphs Determined by Their Laplacian Degree Product Adjacency Spectrum
by: Asim Khurshid, et al.
Published: (2022-01-01)