Computation Of RSA Algorithm Using Gaussian Graceful Labeling

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 incorporates a forward and backward ciphertext method, which applies the key in a dual-directional process for encryption and decryption. In this system, plaintext is encrypted using a key derived from Gaussian Graceful Labeling, a technique rooted in graph theory and Gaussian integers, offering a high degree of cryptographic complexity. The same key is then used in reverse to decrypt the message. The forward and backward mechanism provides an additional layer of efficiency, reducing computational overhead while maintaining strong security guarantees. This dual-directional process, coupled with the intricate properties of Gaussian integers, ensures a cryptosystem that is both computationally efficient and resistant to modern cryptographic attacks.