A public key encryption scheme based on factoring and discrete logarithm

Dimitrios Poulakis · Journal of Discrete Mathematical Sciences and Cryptography · 2009

We present a cryptosystem which is a combination of the DRSA and ElGamal cryptosystems. Its security relies equally on the integer factorization and the discrete logarithm problems. We show that it is at least as secure as each of the DRSA and ElGamal cryptosystems (with messages from a subgroup) which are semantically secure.

Read the paper · More papers on PaperTik