Timeline for How to generate the n-torsion group in an elliptic curve
Current License: CC BY-SA 2.5
2 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 9, 2010 at 3:06 | comment | added | Sarah | This could be what I want, although it's true I was hoping for an algorithm that is, as you say, "better than this direct one." To be more specific about what I am ultimately interested in, if we write $G = E[n]$ and then $G = G_1\times G_2$ for these cyclic groups of order $n$, I was hoping to find efficiently computable maps $f:G\rightarrow G_1$ and $g:G\rightarrow G_2$, which I assumed (perhaps incorrectly) would be related somehow to the structure of the groups themselves. | |
| Sep 9, 2010 at 1:49 | history | answered | Emerton | CC BY-SA 2.5 |