Timeline for How do we guarantee plaintext is coprime in RSA?
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 15, 2015 at 3:38 | comment | added | poncho | And, as fkaiem points out, even if N and P aren't coprime, it turns out RSA works out as well, as $x^{ed} \equiv x \pmod{N}$ for all $x$, including those not relatively prime to N | |
| May 15, 2015 at 0:23 | vote | accept | Gordon | ||
| May 15, 2015 at 0:13 | history | edited | mikeazo | CC BY-SA 3.0 |
added 283 characters in body
|
| May 15, 2015 at 0:09 | history | undeleted | mikeazo | ||
| May 15, 2015 at 0:09 | history | deleted | mikeazo | via Vote | |
| May 15, 2015 at 0:06 | history | answered | mikeazo | CC BY-SA 3.0 |