Timeline for what is complexity of finding a non-torsion point on elliptic curve
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 13, 2013 at 14:01 | comment | added | somayeh didari | My question is about the complexity!I'm looking for algorithm. | |
| Oct 9, 2013 at 8:32 | comment | added | Jesper Petersen | You can use sage to get two points you are looking for sage: E = EllipticCurve([0,0,0,-1563056672958141,0]) sage: G = E.gens() sage: print G [(48408867 : 194361588954 : 1), (260509445493025 : -4204701905638250451710 : 1)] | |
| Oct 8, 2013 at 21:42 | comment | added | Chris Wuthrich | Proving that a point of infinite order is a generator is much easier than finding one in practice. | |
| Oct 8, 2013 at 17:38 | history | answered | Jesper Petersen | CC BY-SA 3.0 |