I think the problem needs to be profiled. The problem is likely NOT
in elliptic curves, but some
horrendous chain of calls to module operations before getting to the
(same) actual algorithms.
Note that P*2 is slightly faster since it calls directly the member
function of P rather than a
function
On Aug 24, 8:36 am, David Kohel [EMAIL PROTECTED] wrote:
I think the problem needs to be profiled. The problem is likely NOT
in elliptic curves, but some
horrendous chain of calls to module operations before getting to the
(same) actual algorithms.
Note that P*2 is slightly faster since it
Alex Ghitza wrote:
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
Hi,
Hello,
I just noticed that this ticket was closed as fixed. To quote trac:
- -
I guess this has been fixed. With Sage 2.8.2 I get:
sage: E =
I think repeated squaring is not more efficient in all cases. For
example over Z it is only
more efficient if your multiplication algorithm is faster than the
naive one (which is O(n^2) in the number of bits).
So in the case of elliptic curves it really depends on the efficiency
of the addition
On Aug 15, 2007, at 2:37 AM, Michel wrote:
I think repeated squaring is not more efficient in all cases. For
example over Z it is only
more efficient if your multiplication algorithm is faster than the
naive one (which is O(n^2) in the number of bits).
So in the case of elliptic curves it
On Aug 14, 2007, at 4:19 PM, Alex Ghitza wrote:
Hi,
I've looked at ticket #59, in which David Kohel says:
William, my student noticed some slow performance with elliptic
curves
group law. I think there was a huge overhead in duplication:
sage: E = EllipticCurve([GF(101)(1),3])
