A new design public key encryption scheme based on factoring and discrete logarithm problems

Abstract

A new public key encryption scheme is designed which is based on two hard problems namely factoring and discrete logarithm problems. The adversary has to solve the two problems simultaneously in order to recover a corresponding plaintext from the received cipher-text Therefore, this scheme is expected to gain a higher level of security. We next show that, the newly developed scheme is efficient with respect to encryption and decryption since it requires only minimal operations in both algorithms.