Score:1

Verifiable Delay Function - Fake Proofs

tv flag

For unknown group order such as RSA groups $ G %$, it takes $T$ sequential steps to compute the below function (time-lock puzzle).

$$ y = g^{2^T} mod N$$

This paper states that if $ /Phi(N) $ (Group order) is known, it takes only two exponentiation to compute $y$.

$$ e = 2^T mod |G| $$ $$ y = g^e $$

I am not sure I understand how these two results are equivalent.

kelalaka avatar
in flag
$e = 2^T mod |N|$ should be $e = 2^T \bmod \varphi (N)$. Knowing the $\varphi$ helps to reduce the power. The two exponentiation are the last two exponentiation. The operations re not counted.
tv flag
I know it is reduced. However, I give values to check the results but it fails
Yehuda Lindell avatar
us flag
Did you compute $y = g^e \bmod N$? This is also needed.
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.