Timeline for Why is it important that phi(n) is kept a secret, in RSA?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Sep 4, 2020 at 9:35 | history | suggested | Toomany Bees | CC BY-SA 4.0 | minor fixups |
| Sep 4, 2020 at 3:19 | review | Suggested edits | |||
| S Sep 4, 2020 at 9:35 | |||||
| Dec 21, 2012 at 18:24 | history | edited | Nik Bougalis | CC BY-SA 3.0 | Mention that P and Q must be kept secret. |
| Dec 21, 2012 at 18:21 | comment | added | Nik Bougalis | That's a fair point; I could have added a note about that, but the fact is that $P$ and $Q$ should be kept secret is well known and the original question was: "Why is it important that $ϕ(n)$ is kept a secret, in RSA?" | |
| Dec 21, 2012 at 9:07 | comment | added | Paŭlo Ebermann | This misses a bit about "why do we need these primes to be secret". RSA's goal is not to hide the factorization, but to be a trapdoor one-way function. | |
| Dec 20, 2012 at 13:20 | history | edited | Nik Bougalis | CC BY-SA 3.0 | deleted 8 characters in body |
| Dec 20, 2012 at 13:14 | history | answered | Nik Bougalis | CC BY-SA 3.0 |