#6407: Multiplication-by-n method on elliptic curve formal groups should use the
double-and-add algorithm
-------------------------+--------------------------------------------------
Reporter: hlaw | Owner: hlaw
Type: enhancement | Status: new
Priority: minor | Milestone: sage-4.1
Component: performance | Keywords: formal group elliptic curve
Reviewer: | Author:
Merged: |
-------------------------+--------------------------------------------------
Currently `EllipticCurveFormalGroup.mult_by_n()` is implemented simply by
applying the group law to itself ''n'' times (except when working over a
field of characteristic zero, in which case a fast algorithm is used).
This linear algorithm should be replaced with the logarithmic double-and-
add algorithm (i.e. the additive version of the standard square-and-
multiply algorithm).
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/6407>
Sage <http://sagemath.org/>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected]
To unsubscribe from this group, send email to
[email protected]
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en
-~----------~----~----~----~------~----~------~--~---
