Join Log in
Score:1
Turbo avatar Crypto

Division by $2$ or principal root with DH oracle

ru flag
Turbo

Assume $g$ is generator of multiplicative group modulo prime $p=2q+1$ where $q$ is prime.

Assume we know $g^{2t}\bmod p$ and $g^{2}\bmod p$ and assume we can have access to a Diffie-Hellman oracle.

Can we find $g^t\bmod p$ in polynomial time?

Note if we can do that we can break discrete log with access to a DH oracle when generator order is even.

46
0 + 0
Score:2
poncho avatar Crypto
my flag
poncho

Can we find $g^t \bmod p$ in polynomial time?

We can find either $g^t$ or $-g^{t} = g^{t + (p-1)/2}$; obviously, we can't tell which one was the correct one with the information we were given.

Because $p \equiv 3 \pmod 4$ (because $(p-1)/2$ is assumed to be prime, and taking $p=5$ off the table - that can be handled as a special case), then [1] we can compute modular square-roots with the simple computation $\sqrt{x} = \pm x^{(p+1)/4}$.

So, we have $g^t \in\{ -(g^{2t})^{(p+1)/4},+(g^{2t})^{(p+1)/4}\}$, easily doable in polytime.

[1]: If $p \equiv 1 \bmod 4$, then it is still practical to compute modular squareroots, it's a bit more involved.

0 + 0
Turbo avatar
ru flag
Turbo
True.. but can the oracle resolve the ambiguity in the sign?
0
Reply
poncho avatar
my flag
poncho
@Turbo: no, it can't, because both values are possible solutions for $g^t$
0
Reply
ธงชาติไทย
Elon Musk
I sit in a Tesla and translated this thread with Ai:

mangohost

Post an answer

Most people don’t grasp that asking a lot of questions unlocks learning and improves interpersonal bonding. In Alison’s studies, for example, though people could accurately recall how many questions had been asked in their conversations, they didn’t intuit the link between questions and liking. Across four studies, in which participants were engaged in conversations themselves or read transcripts of others’ conversations, people tended not to realize that question asking would influence—or had influenced—the level of amity between the conversationalists.