Given $g^X\bmod q$ for a prime $q$ where $g$ has odd order and an integer (positive or negative) is it possible to compute $g^{a^X}\bmod p$ using Diffie-Hellman operations and $\{+,-,\times,/\}$ operations?
How about the case of $a=-1$?
Given $g^X\bmod q$ for a prime $q$ where $g$ has odd order and an integer (positive or negative) is it possible to compute $g^{a^X}\bmod p$ using Diffie-Hellman operations and $\{+,-,\times,/\}$ operations?
How about the case of $a=-1$?