Timeline for Why does square root $\pmod n$ find $p$ and $q$ (as $n = p \cdot q$)?
Current License: CC BY-SA 4.0
15 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 2, 2020 at 16:49 | vote | accept | Max Beikirch | ||
| Aug 27, 2019 at 3:00 | history | tweeted | twitter.com/StackCrypto/status/1166183755901558791 | ||
| Aug 19, 2019 at 8:45 | comment | added | fgrieu♦ | From $n = p*q$, with $p \neq q$ and $x^2\equiv1 \pmod n$, $x+1 \not\equiv 0 \pmod n$, $x-1 \not\equiv 0 \pmod n$, its does not follow $\gcd(x+1,n) \in \{p,q\}$. We additionally need that $p$ and $q$ are prime. However, that's not because we must include $x=1$; that is ruled out by $x-1 \not\equiv 0 \pmod n$ | |
| Aug 18, 2019 at 16:36 | comment | added | kelalaka | @MaartenBodewes sure. | |
| Aug 18, 2019 at 16:34 | comment | added | Maarten Bodewes♦ | @kelalaka You may want to support my feature request: github.com/mathjax/MathJax/issues/2084 | |
| Aug 18, 2019 at 14:24 | history | edited | Maarten Bodewes♦ | CC BY-SA 4.0 |
edited title
|
| Aug 18, 2019 at 11:41 | history | became hot network question | |||
| Aug 17, 2019 at 19:45 | review | Close votes | |||
| Aug 27, 2019 at 3:05 | |||||
| Aug 17, 2019 at 19:25 | comment | added | yyyyyyy | Possible duplicate of Factoring large $N$ given oracle to find square roots modulo $N$ | |
| Aug 17, 2019 at 19:08 | answer | added | zajic | timeline score: 6 | |
| Aug 17, 2019 at 18:58 | answer | added | kelalaka | timeline score: 3 | |
| Aug 17, 2019 at 18:45 | comment | added | kelalaka | Welcome to Cryptography. We have $MathJax$ in our site. Please check my modifications. Also, in short, you can say, $x \neq \pm 1 \pmod n$ | |
| Aug 17, 2019 at 18:44 | history | edited | kelalaka | CC BY-SA 4.0 |
latex syntax
|
| Aug 17, 2019 at 18:40 | review | First posts | |||
| Aug 17, 2019 at 18:44 | |||||
| Aug 17, 2019 at 18:40 | history | asked | Max Beikirch | CC BY-SA 4.0 |