[Solved]813 Encrypt Following Messages Elgamal Scheme P 467 2 1 Kpr D 105 213 X 33 2 Kpr D 105 123 Q37257877

8.13. Encrypt the following messages with the Elgamal scheme (p= 467 and α = 2): 1. kpr = d = 105, i = 213, x = 33 2. kpr = d =105, i = 123, x = 33 3. kpr = d = 300, i = 45, x = 248 4. kpr = d =300, i = 47, x = 248 Now decrypt every ciphertext and show allsteps.

8.17. Considering the four examples from Problem 8.13, we seethat the Elgamal scheme is nondeterministic: A given plaintext xhas many valid ciphertexts, e.g., both x = 33 and x = 248 have thesame ciphertext in the problem above. 1. Why is the Elgamalsignature scheme nondeterministic? 2. How many valid ciphertextsexist for each message x (general expression)? How many are therefor the system in Problem 8.13 (numerical answer)? 3. Is the RSAcrypto system nondeterministic once the public key has beenchosen?

Expert Answer

---

Answer to 8.13. Encrypt the following messages with the Elgamal scheme (p = 467 and α = 2): 1. kpr = d = 105, i = 213, x = 33 2. … . . .