Timeline for Factorization of RSA modulus using a qubic residue
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 31, 2016 at 14:53 | answer | added | user94293 | timeline score: 2 | |
| May 31, 2016 at 10:15 | comment | added | brick | @user94293 I am not sure that this is true if $c$ has more than $3$ qubic roots $(\mod n)$. Can you explain more precisely ? | |
| May 31, 2016 at 7:53 | comment | added | fgrieu♦ | If the public exponent divides $(p−1)(q−1)$, then there is no well-defined private key, and that's not RSA. | |
| May 31, 2016 at 2:34 | comment | added | user94293 | If $y^3 \equiv c \pmod n$ and $z^3 \equiv c \pmod n$ then $\gcd(y-z,n)$ should give a factor of $n$. | |
| May 30, 2016 at 22:52 | review | First posts | |||
| May 31, 2016 at 6:21 | |||||
| May 30, 2016 at 22:47 | history | asked | brick | CC BY-SA 3.0 |