Prove that the hardness of the CDH problem relative to G implies the hardness of the discrete logarithm problem relative to G.
Where G is a polynomial-time algorithm that, on input 1^n, outputs a description of a cyclic group G, its order q, and a generator g.
The CDH problem is computational Diffie-Hellman problem.