-
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…
-
The user has three new options of finite extension fields:
1. "legendre" - as the name implies: using Legendre symbols
```
sage: k. = GF(3^10)
sage: E = EllipticCurve(k,[k.random_element() for _ in…
malb updated
16 years ago
-
Some of the code for computing the cardinality of an elliptic curve over a non-prime finite field manages to cache a value of type Rational instead of Integer. [This is caused by norms from orders…
-
```
From David Kohel:
> ... dlog in SAGE mod p is slow.
Anyway, yes, PARI has a function znlog, which should be very fast:
gp.znlog
I'll have to add it to the PARI interface (libs/pari/ge…
-
The computational cost of Shanks' Baby-Step Giant-Step algorithm and Pollard's rho and lambda algorithms are more or less the same, but the memory costs is much worse for Shanks' algorithm. It woul…
-
Marshall Buck reports (email to sage-support 2008-02-29):
Problem 1. Fails because the list sizes in the baby step giant step
method are too small.
Example. [NB This particular example does *not*…