A Modified RSA Cryptosystem for Cloud Security Using Residue Numbers System
Abdul-Ganiwu Yahaya, Peter Awonnatemi Agbedemnab, Edem K. Bankas · International Journal of Computer & Organization Trends · 2024
Securing transmitted data on a cloud is an important issue. Integer factorization and discrete logarithm issues are two examples of number theory applications that are crucial to public-key cryptosystems. In the majority of applications, these systems make a great choice, and their security is well-defined and understood. The drawbacks of computational complexity are one of the main issues. Consequently, a different strategy that would improve computing efficiency and security is required. This paper proposes an efficient asymmetric cryptographic scheme by utilizing the inherent properties of the Residue Number System (RNS) and the existing RSA Cryptosystem to encrypt any data size suitable for securing data on cloud systems. The generation of the public and private keys is determined by the selected moduli, which also contains the secret information. These moduli are sensitive to any slight modification resulting in corrupt information when decrypted. The obtained results of the simulation indicate substantial improvement over the best-known equivalent state of the art in terms of computation, power consumption, and runtime. The proposed approach has the ability to identify and rectify errors that may occur in the encrypted data.