Timeline for How to compute the discrete logarithm of Diffie-Hellman with a composite modulus?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 7, 2016 at 14:55 | comment | added | David 天宇 Wong | the $g^x$ mod $p$ and $q$ have solutions in $p-1$ and $q-1$, so I cannot recompute it in $pq$, rather $(p-1)(q-1)$ which is the order of $\mathbb{Z}^\ast_n$. It is the discrete log that I'm trying to recompute, not $y = g^x$ that I already know | |
| Mar 7, 2016 at 14:42 | comment | added | Raoul722 | So $gcd(p, q) = 1$ and you can directly recompute it modulo $n$ without considering $p_1$, $p_2$, $q_1$, $q_2$. | |
| Mar 7, 2016 at 14:38 | comment | added | David 天宇 Wong | yes all of them are | |
| Mar 6, 2016 at 21:47 | answer | added | Raoul722 | timeline score: 3 | |
| Mar 6, 2016 at 21:46 | comment | added | Raoul722 | You should specify more precisely how your variables are defined. Are $p$ and $q$ prime numbers? Same remark for $p_1$, $p_2$, $q_1$ and $q_2$? | |
| Mar 6, 2016 at 3:48 | history | asked | David 天宇 Wong | CC BY-SA 3.0 |