ElGamal encryption.

ElGamal encryption. Again assume that the message space consists of all 16-bit inte- gers. Consider ElGamal encryption. Let us choose p= 96737. Then we have Z; = {1,..., 96736} Write a program to find g, the smallest generator of Zp, i.e., g is the smallest number in Z such that the set {g mod p, g- mod p, g96736 mod p} = 27. Provide the value g. (The program can simply tries each number starting with 2 and see whether it is a generator. A number a is a generator for Zif and only if the smallest positive integer j such that g mod p= 1 is j = p - 1.) 2 ElGamal encryption. Again assume that the message space consists of all 16-bit inte- gers. Consider ElGamal encryption. Let us choose p= 96737. Then we have Z; = {1,..., 96736} Write a program to find g, the smallest generator of Zp, i.e., g is the smallest number in Z such that the set {g mod p, g- mod p, g96736 mod p} = 27. Provide the value g. (The program can simply tries each number starting with 2 and see whether it is a generator. A number a is a generator for Zif and only if the smallest positive integer j such that g mod p= 1 is j = p - 1.) 2