ElGamal is homomorphic. Let G be a cyclic group of order q with generator g. Consider the encryptions of two messages mi and m2 with an ElGamal public key (p,g,h-g): enc(m1) = (mih".gM) and enc(m2)-(m2hy2o") (Here each yi is {0, 1, . . . , q-1} and, as usual, each mh E G.) Given these two ciphertexts show how an eavesdropper can produce a legal ciphertext for the message mim2 (even without knowing the messages mi or the secret values yi and y2) a random element of the set ElGamal is homomorphic. Let G be a cyclic group of order q with generator g. Consider the encryptions of two messages mi and m2 with an ElGamal public key (p,g,h-g): enc(m1) = (mih".gM) and enc(m2)-(m2hy2o") (Here each yi is {0, 1, . . . , q-1} and, as usual, each mh E G.) Given these two ciphertexts show how an eavesdropper can produce a legal ciphertext for the message mim2 (even without knowing the messages mi or the secret values yi and y2) a random element of the set