The security of Elgamal The Dififiie-Hellman problem Given a prime p,g e zp, and x, y e zp, find xlog y moap The security of the ElGamal encryption is reduced to the difficulty of breaking the Diffie-Hellman problem14 The security of ElGamal • The Diffie-Hellman problem. Given a prime p, g e Zp * , and x,y e Zp * , find x log g y mod p. The security of the ElGamal encryption is reduced to the difficulty of breaking the Diffie-Hellman problem