An Efficient RSA Cryptosystem with BM-PRIME Method

The RSA cryptosystem due to Rivest, Shamir and Adleman is one of the most popular public key cryptosystem and widely used to ensure privacy and authenticity of electronic data. Using more than two factors in the modulus of the RSA cryptosystem has the arithmetic advantage that the private key computation can be speeded up by CRT. With this idea, the authors present an efficient combination of two variants of RSA cryptosystem (Batch and Mprime RSA) which makes the decryption process faster than the existing variants. It can not only speed up RSA decryption but also guarantee the security of RSA cryptosystem.