Encryption and decryption of signed graph matrices through RSA algorithm

Obaidullah Wardak (), Deepa Sinha () and Anshu Sethi ()
Additional contact information
Obaidullah Wardak: South Asian University
Deepa Sinha: South Asian University
Anshu Sethi: The NorthCap University

Indian Journal of Pure and Applied Mathematics, 2024, vol. 55, issue 4, 1477-1484

Abstract: Abstract Information security and confidentiality are burning issues in today’s digitally connected world. Encryption is considered a fast-moving trend in this reference. Although we see rigorous enhancements in the development of information security tools, storage and retrieval, enormous challenges still occur due to unsecured transmission channels, hacking tools and the ubiquity of the Internet. This paper proposes a new cryptography mechanism for secure data transmission and retrieval using a signed graph, its adjacency matrix and the RSA algorithm.

Keywords: Signed graph; Encryption; Decryption; Algorithm; RSA algorithm (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13226-023-00452-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:55:y:2024:i:4:d:10.1007_s13226-023-00452-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-023-00452-9

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().