Yes, but the order of the group is what is given and I can't assume that we're in \mathbb{Z}^*_p so modular arithmetic and Fermat's theorem seem to be an isomorphism away (at least). But apart from the exact value of the exponent you seem to agree that it's possible to efficiently calculate the...
Homework Statement
The original problem has to do with telling messages encrypted with a version of the ElGamal public key crypto system apart. It relies on exponentiation in an arbitrary cyclic group G of prime order p with generator g. The public key is y = g^x where x is the private key...