Timeline for RSA Proof of Correctness
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 19, 2023 at 18:44 | comment | added | synack | How come $m \pmod p=0$ in the second part of the proof? Isn’t RSA defined in the multiplicative group $\mathbb Z_n$? $0$ is not in $\mathbb Z_n$… | |
| S Jul 23, 2022 at 20:00 | history | suggested | Lele99_DD | CC BY-SA 4.0 |
TeX improvements
|
| Jul 20, 2022 at 14:53 | review | Suggested edits | |||
| S Jul 23, 2022 at 20:00 | |||||
| Mar 20, 2018 at 21:30 | comment | added | fgrieu♦ | With $p$ and $q$ prime, $\gcd(p,q)=1$ is the same as $p≠q$. It is unclear if the proof hypothesize $p$ and $q$ prime. If it does not, it is incorrect in the fragment "Because $\gcd(m, N) \neq 1$ one between $\gcd(m, N) = p$, and $\gcd(m, N) = q$ must stand true". Further, there's a notation problem: $m\cdot(m^{\phi(N)})^k=m \bmod N$ is simply wrong when we take $\bmod\;$ to be the operator "remainder of the Euclidean division". We have $m\cdot(m^{\phi(N)})^k\equiv m\pmod N$, or $m=m \cdot(m^{\phi(N)})^k\bmod N$. | |
| Mar 20, 2018 at 8:28 | history | edited | Henno Brandsma | CC BY-SA 3.0 |
Tex improvements
|
| Mar 20, 2018 at 8:13 | history | edited | Henno Brandsma | CC BY-SA 3.0 |
added 7 characters in body
|
| Apr 13, 2017 at 12:48 | history | edited | CommunityBot |
replaced http://crypto.stackexchange.com/ with https://crypto.stackexchange.com/
|
|
| Jun 12, 2016 at 16:38 | comment | added | Jako | you wrote "e ∈ Zn"; but e should be chosen with this criteria gcd(ϕ(N),e)=1 ; in other words e should be coprime with ϕ(N). See here crypto.stackexchange.com/questions/12255/… | |
| Oct 4, 2013 at 17:00 | vote | accept | Matteo | ||
| Jun 19, 2012 at 12:03 | vote | accept | Matteo | ||
| Jun 19, 2012 at 12:04 | |||||
| Jun 13, 2012 at 21:06 | history | edited | Matteo | CC BY-SA 3.0 |
added 8 characters in body
|
| Jun 13, 2012 at 20:55 | history | edited | Matteo | CC BY-SA 3.0 |
added 16 characters in body
|
| Jun 13, 2012 at 20:49 | history | answered | Matteo | CC BY-SA 3.0 |