Skip to main content
added 45 characters in body
Source Link
Turbo
  • 1k
  • 6
  • 14

Given $g^X\bmod q$ for a prime $q$ where $g$ has odd order and an integer is it possible to compute $g^{a^X}\bmod p$ using polynomially many Diffie-Hellman operations and $\{+,-,\times,/\}$ operations?

$X$ is positive and at most order of $g$.

Given $g^X\bmod q$ for a prime $q$ where $g$ has odd order and an integer is it possible to compute $g^{a^X}\bmod p$ using Diffie-Hellman operations and $\{+,-,\times,/\}$ operations?

Given $g^X\bmod q$ for a prime $q$ where $g$ has odd order and an integer is it possible to compute $g^{a^X}\bmod p$ using polynomially many Diffie-Hellman operations and $\{+,-,\times,/\}$ operations?

$X$ is positive and at most order of $g$.

deleted 33 characters in body
Source Link
Turbo
  • 1k
  • 6
  • 14

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?

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?

Given $g^X\bmod q$ for a prime $q$ where $g$ has odd order and an integer is it possible to compute $g^{a^X}\bmod p$ using Diffie-Hellman operations and $\{+,-,\times,/\}$ operations?

deleted 33 characters in body
Source Link
Turbo
  • 1k
  • 6
  • 14

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

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?

Post Undeleted by Turbo
Post Deleted by Turbo
Source Link
Turbo
  • 1k
  • 6
  • 14
Loading