Timeline for What is so special about elliptic curves?
Current License: CC BY-SA 4.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Mar 14 at 10:23 | history | suggested | CommunityBot | CC BY-SA 4.0 |
Update link
|
| Mar 14 at 4:00 | review | Suggested edits | |||
| S Mar 14 at 10:23 | |||||
| Nov 8, 2013 at 2:01 | comment | added | Samuel Neves | A sphere ($x^2 + y^2 + z^2 = 1$) would still not be secure; however, if you intersect two quadric surfaces (i.e. surfaces defined by quadratic polynomials) you actually can get a secure curve, which --- guess what --- is actually an elliptic curve! The Jacobi intersection curves are an example of this. | |
| Nov 6, 2013 at 15:55 | comment | added | stackuser | So elliptic curves are like the sweet spot over a continuum of equations that might be used over a group. That continuum seems like it ranges from "way too expensive for computation" (hyper/super elliptic curves) to "the DLP is not difficult enough" (putting P and Q over a conic section or circle). Although your conic section made me wonder why a sphere in $R^{3}$ wouldn't work, too expensive perhaps. +1 and accepted. | |
| Nov 5, 2013 at 23:17 | vote | accept | stackuser | ||
| Nov 5, 2013 at 7:21 | history | answered | Samuel Neves | CC BY-SA 3.0 |