You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
In sage/elliptic_curves/sll_points.py in the function EllipticCurvePoint_finite_field.order() a tiny blunder causes a huge inefficiency. The BSGS function is used to find a multiple of the order of the point (when the group order is not yet known), and the existing code
M = self._bsgs(E(0),0,ub)
should be
M = self._bsgs(E(0),lb,ub)
since there is a lsolution in the interval [lb..ub]. This changes the complexity from O(q^1/2) to O(q^1/4).
JohnCremona
changed the title
serious inefficiency in order of points on elliptic curvews over finite fields
[with nano-patch, needs review] serious inefficiency in order of points on elliptic curvews over finite fields
Mar 16, 2008
ncalexanmannequin
changed the title
[with nano-patch, needs review] serious inefficiency in order of points on elliptic curvews over finite fields
serious inefficiency in order of points on elliptic curvews over finite fields
Mar 16, 2008
In sage/elliptic_curves/sll_points.py in the function
EllipticCurvePoint_finite_field.order()
a tiny blunder causes a huge inefficiency. The BSGS function is used to find a multiple of the order of the point (when the group order is not yet known), and the existing codeshould be
since there is a lsolution in the interval [lb..ub]. This changes the complexity from
O(q^1/2)
toO(q^1/4)
.Component: algebraic geometry
Issue created by migration from https://trac.sagemath.org/ticket/2561
The text was updated successfully, but these errors were encountered: