Double Key Pair and Hidden Modulus RSA Cryptosystem

Data security is that the primary concern of every individual and organization. To assure the security of data, cryptography is the prime mechanism. RSA is most widely accepted as a reliable asymmetric key cryptography. Since, its reliability depends on the hardness of factoring large common modulus which is accessible for the public, this accessibility of the common modulus could exposed RSA to various cryptanalysis attacks: Shor’s quantum polynomial-time algorithm, D-Wave quantum computer attacks, double encryption attack, and low private exponent attack. To address this weaknesses, this paper proposes an asymmetric key cryptosystem named as Double Key Pair and Hidden Modulus RSA (DKPHM-RSA) which introduces additional key pair, and the public mask modulus which is a pseudo random masking number derived from real modulus. Replacing the second real modulus, this derived public mask modulus is introduced in a second public key component; as a result, a second real modulus kept hidden from the public unlike the case in RSA. To improve data security, additional public key exponent along with public mask modulus are used for second encryption while additional private key with additional real modulus is used for the first decryption process. For performance analysis Net bean IDE 8.2 is used, and the proposed DKPHM-RSA algorithm is compared with state-of-the-art algorithms: RSA, ESRKGS, HRM-RSA, and MRSA based on key generation speed, encryption speed, decryption speed, time complexity, resistance to attacks, and avalanche effect. The performance analysis shows that DKPHM-RSA is less complex and highly secured than state-of-the-art algorithms. It improves key generation speed of ESRKGS, and MRSA by 298%, 31%; encryption time of RSA, ESRKGS, MRSA, HRM-RSA by 34%, 263%, 1331%, 33%; decryption speed of ESRKGS, MRSA by 51%, 404%, respectively.