Question

Which Cryptographic system uses C1 = (e1^r) mod p and C1 = (e2^r x P) mod p at the encryption side?

(a) Elgamal

(b) RSA

(c) Rabin

(d) Whirlpool

This question was posed to me in an international level competition.

I would like to ask this question from Rabin/ Elgamal Algorithm in division Public Key Cryptography and RSA of Cryptograph & Network Security

Answer 1

Right option is (a) Elgamal

To explain I would say: The  Elgamal cryptographic system uses the above formulae to compute the CT.