Computation Of RSA Algorithm Using Gaussian Graceful Labeling
Kavitha, S. and Jayalalitha, G. (2025) Computation Of RSA Algorithm Using Gaussian Graceful Labeling. Computation Of RSA Algorithm Using Gaussian Graceful Labeling.
Kavitha.Jayalalitha_ComputationOfRSAAlgorithmUsingGaussianGracefulLabeling1.pdf
Download (2MB)
Abstract
This study introduces a novel encryption mechanism leveraging the Gaussian Graceful. Labeling technique, designed to enhance both the security and efficiency of cryptographic systems. The method builds upon the RSA cryptosystem, integrating Gaussian Graceful Labeling to generate robust and secure keys. To further optimize performance, the approach incorparates a forward and backward ciphe1text method, which applies the key in a dual-diTectional process for enc1-yption and dea-yption. In this system, pl.aintext is enc,-ypted using a key derived from Gaussian Graceful Labeling, a technique rooted in graph theo1-y and Gaussian integers, offering a high degree of cryptographic complexity. The same key is then used in reverse to dee1-ypt the message. The fo1ward and backward mechanism provides an additional I.ayer of efficiency, reducing computational overhead while maintaining strong security guarantees. This dual-directional process, coupled with the intricate properties of Gau.ssian integers, ensures a cryptosystem that is both computationally efficient and resistant to modem c1-yptographic attacks.
| Item Type: | Article |
|---|---|
| Subjects: | Mathematics > Graph Theory |
| Depositing User: | Mr IR Admin |
| Date Deposited: | 11 May 2026 06:09 |
| Last Modified: | 11 May 2026 06:09 |
| URI: | https://ir.vistas.ac.in/id/eprint/15898 |
