Skip to main content
1 of 4
Turbo
  • 1k
  • 6
  • 14

Computing $g^{a^X}\bmod q$ with Diffie-Hellman operations

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$?

Turbo
  • 1k
  • 6
  • 14