Ticket #1120 (closed enhancement: fixed)
[with patch] speed up point counting for elliptic curves over GF(p^n) if coefficients are in GF(p)
|Reported by:||malb||Owned by:||was|
If possible #E is computed over the prime subfield now.
sage: EllipticCurve(GF(4,'a'),[1,2,3,4,5]).cardinality() 8 sage: k.<a> = GF(3^3) sage: l = [a^2 + 1, 2*a^2 + 2*a + 1, a^2 + a + 1, 2, 2*a] sage: EllipticCurve(k,l).cardinality() WARNING: Using very very stupid algorithm for counting points over non-prime finite field. Please rewrite. See the file ell_finite_field.py. 29 sage: l = [1, 1, 0, 2, 0] sage: EllipticCurve(k,l).cardinality() 38
Note: See TracTickets for help on using tickets.