Timeline for Soft question: What are examples of beautiful proofs in cryptography?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 10, 2019 at 14:22 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Expand on note about the result's background. Cite the primary source.
|
| Jun 6, 2019 at 5:46 | comment | added | Snoop Catt | @SqueamishOssifrage Yes, thank you. | |
| Jun 6, 2019 at 3:57 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Give some historical context.
|
| Jun 5, 2019 at 14:08 | comment | added | Squeamish Ossifrage | @Chipotle Fixed, and elaborated. Better? | |
| Jun 5, 2019 at 14:05 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Fix typo. Expand on why this doesn't work for RSA.
|
| Jun 5, 2019 at 12:18 | comment | added | Marc Ilunga | @Chipolte, the uniqueness of the $e$'th root comes from the fact that encryption in RSA is a permutation. | |
| Jun 5, 2019 at 7:02 | comment | added | Snoop Catt | That's a great answer! I never noticed that $y$ would have four distinct roots in $n=pq$ modulus (a non-trivial fact). Also, there is a typo: $x^2 \equiv y^2$ should be $x^2 \equiv \xi^2$. Could you also elaborate on your concluding remark? why is there a unique $e$'th root? | |
| Jun 4, 2019 at 22:47 | history | edited | Squeamish Ossifrage | CC BY-SA 4.0 |
Square roots are not unique: a, not the.
|
| Jun 4, 2019 at 22:36 | history | answered | Squeamish Ossifrage | CC BY-SA 4.0 |