This is a homework assignment that's been giving me some trouble:
By eavesdropping on a Diffie-Hellman key exchange, we observe
modulus $p$
the base $3$
$A\ =\ 3^a \bmod p\quad$ and
$B\ =\ 3^b \bmod p$
If we somehow had access to the secret $=\ 3^{ab} \bmod p$, how could you retrieve the secret exponents $a$ and $b$?
$p$ is 996-bit. $A$, $B$ also are very large numbers. I think I am missing something about exponential arithmetic. I've tried working on the actual numbers using PARI/GP, but the numbers are too big to use the built-in discrete logarithm functionality.