An EHSA for RSA Cryptosystem

Abstract

This paper presents a new Enhanced Hybrid Security Algorithm (EHSA) for RSA cryptosystem, which is compared with an encryption algorithm using dual modulus in various aspects such as key generation time, encryption time, decryption time, and data security. The proposed scheme uses eight different prime integers for the computation of two modulus values, which generate the two different public keys and private keys. Thus the complexity involved in factorizing the modulus value increases. Also, the proposed algorithm uses double encryption and decryption using double private and public keys to provide security against Brute-force attack. Therefore, if an intruder detects a single key of cryptosystem even then it is not possible to decrypt the message. Also, it is difficult to factorize the modulus value into its four prime factors. Thus, it enhances the security of encrypted data two times.