Hybrid Security RSA Algorithm in Application of Web Service

Abstract

A new hybrid security algorithm is presented for RSA cryptosystem named as Hybrid RSA. The system works on the concept of using two different keys- a private and a public for decryption and encryption processes. The value of public key (P) and private key (Q) depends on value of M, where M is the product of four prime numbers which increases the factorizing of variable M. moreover, the computation of P and Q involves computation of some more factors which makes it complex. This states that the variable x or M is transferred during encryption and decryption process, where x represents the multiplication of two prime numbers A and B. thus, it provides more secure path for encryption and decryption process. The proposed system is compared with the RSA and enhanced RSA (ERSA) algorithms to measure the key generation time, encryption and decryption time which is proved to be more efficient than RSA and ERSA.