ASKSAGE: Sage Q&A Forum - RSS feedhttps://ask.sagemath.org/questions/Q&A Forum for SageenCopyright Sage, 2010. Some rights reserved under creative commons license.Fri, 25 Mar 2016 14:41:10 +0100Error with .cardinality(algorithm='sae') for elliptic curvehttps://ask.sagemath.org/question/26761/error-with-cardinalityalgorithmsae-for-elliptic-curve/Hello please i have a problem. I have already defined an elliptic curve over a ring `Zn` and i want to compute its cardinality but i can not use `.cardinality(algorithm='sae')`. Thank you.
Here is the programme that i want to implement.
def cardin(n,A,B)
Z = Zmod(n) # n is not a prime then Z is a ring
E = EllipticCurve(Z,(A,B))
return E.cardinality(algorithm='sae') "sae=Schoof Atkin"
TypeError: cardinality() got an unexpected keyword argument 'algorithm'kotorakotoFri, 08 May 2015 17:11:39 +0200https://ask.sagemath.org/question/26761/Elliptic curve scalar multiplication algorithmhttps://ask.sagemath.org/question/32886/elliptic-curve-scalar-multiplication-algorithm/ I'm doing a prespective on supersinguar elliptic curves. I was wondering how saga calculates scalar multiplications? Does it just calculate it naively or does it use succesive doubling as default? Til is most interesting since there are well known ways of making "shortcuts" when oberating with supersingular curves, but does sage use these?BelphegorFri, 25 Mar 2016 14:41:10 +0100https://ask.sagemath.org/question/32886/