Prove that a machine that solves Decisional Diffie-Hellman problem mod p can be used to decide the
Fantastic news! We've Found the answer you've been seeking!
Question:
Prove that a machine that solves Decisional Diffie-Hellman problem mod p can be used to decide the validity of mod p ElGamal ciphertexts, and a machine that decides the validity of mod p ElGamal ciphertexts can be used to solve Decision Diffie-Hellman problems mod p.
Related Book For
Posted Date: