Re: Proving the hardness of a problem similar to the representation problem

You are right, sorry for this mistake. The description is:

I'm trying to prove that it is not possible to generate two pairs
(x,y) and (x',y') so that g1 ^ x + g2 ^ y = g1 ^ x' + g2 ^ y' (mod p).
p is a prime and Gq is a group of known prime order q. Gq is a
subgroup of Zp* with p=k*q+1. g1 and g2 are elements of Gq not equal
to 1 (i.e. g1 and g2 are generators). How can I prove that it is a
difficult problem (e.g. equivalent to DL)?

...

> I think there must be a typo in your description.  If the modulus q
> is a prime, then g1 and g2 can't have order q; their order divides q-1.
>
> Did you mean g1^x + g2^y = g1^x' + g2^y' (mod p), where p is prime,
> q is prime, q divides p-1, and g1,g2 are of order q?  Or did you mean
> that g1 and g2 have order q-1?