Hello,
I am using sage 3.4
I have written a simple sage script to evalute the cardinal of Brent-
Suyama elliptic curves s=11
for primes < 2^27.
Memory usage increases till program (or machine) crashes.
The script is the following:
p=30
def FindGroupOrder(p,s):
K = GF(p)
v = K(4*s)
u = K(s**2-5)
x = u**3
b = 4*x*v
a = (v-u)**3*(3*u+v)
A = a/b-2
x = x/v**3
b = x**3 + A*x**2 + x
E = EllipticCurve(K,[0,b*A,0,b**2,0])
return factor(E.cardinality())
while p<134217689:
p=next_prime(p)
g=FindGroupOrder(p,11)
print g
Any idea why this happens?
Regards,
--~--~---------~--~----~------------~-------~--~----~
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-support
URLs: http://www.sagemath.org
-~----------~----~----~----~------~----~------~--~---