Rare project developers

[mc36 <>]

hi,

can i ask you to help me solve a long lived question of me please:
(i ask you because you're the only well skilled mathematician i know)
(if it's outside of your interest, please forward it someone)

which is harder to find out both a and b:

( (g^a)^b) % p == ( (g^b)^a) % p
where g is 2 or 5, p is a 8192 bit prime, both well known, a and b are both 
secrets
here we are talking about positive integers

or

a*b == b*a
here the computation is performed over 448bit elliptic curves


my reasoning is that reversing the multiplication should be easier than 
solving the discrete logarithm problem

i see that it is an apples to oranges kind of question so a weak conjecture 
is much more than enough

thanks,
cs