A hybrid security algorithm for RSA cryptosystem

Abstract

This paper presents a new Hybrid security algorithm for RSA cryptosystem named as Hybrid RSA (HRSA). Here computation of public (P) as well as private (Q) depends on the value of M, where M is the product of four prime numbers. So complexity involved in factorizing the variable M increases. Another interesting feature about this algorithm is that the computation of P and Q involves the computation of some more intermediate factors which makes the computation more complex. In other existing works, the variable x or M is transferred during and process. However, this approach eliminates the transfer of variable x and M, where x represents the multiplication of two prime numbers a and b. Thus the proposed approach provides more secure path for and process. To substantiate this fact, the key generation time, encryption speed and decryption speed of the proposed HRSA have been compared with conventional RSA and ERSA algorithms.