I would like to compute the cardinality of a 512-bit curve in Sage. For example, for y^2 = x^3 + a4.x + a6 mod p where
p=10566623376041669505825220895462627801380145726624712771836144280024219722297939525451022774579043146020265329009462778097121538072213487555318041328039599 a4=6557325753041215216697541661243177462316789827714644669153173743634615853451990973713919498189870050066222585898470391225455349541996119434962754618249308 a6=3887529832007272230349363633177495741990999092935596186265775681498612008751646149414901742385996951003068331698140100902826619262789957720578797201032523 When I tried to do so using the E.cardinality() function, E = EllipticCurve(GF(p),[a4,a6]) #n = E.order() I got the error similar to what was mentioned here: http://trac.sagemath.org/sage_trac/ticket/12403 When I tried to compute the order directly using GP with: E = gp.ellinit([a4,a6],p) ap = E.ellap(E,p) n = p+1-ap I got the following error: *** at top-level..e[9] = ellinit(sage[7],sage[8]) *** *** overflow in t_INT-->long assignment May I know how to work around this problem? Any help is greatly appreciated! -- You received this message because you are subscribed to the Google Groups "sage-support" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/sage-support?hl=en. For more options, visit https://groups.google.com/groups/opt_out.
