State Fermat’s theorem with an example. Given the prime number p=29 and its primitive root g=8, private key sender with X=9 and random integer K=11, encrypt the message m=13 using ElGamal cryptosystem.

This answer is restricted. Please login to view the answer of this question.

Login Now
Leave your Answer:

Click here to submit your answer.

Notify of
Inline Feedbacks
View all comments