Computing the cardinality of CM elliptic curves using torsion points
François Morain
Abstract
Open-access reader
François Morain
Abstract
Open-access reader
Let ℰ / ℚ ¯ be an elliptic curve having complex multiplication by a given quadratic order of an imaginary quadratic field 𝕂 . The field of definition of ℰ is the ring class field Ω of the order. If the prime p splits completely in Ω , then we can reduce ℰ modulo one the factors of p and get a curve E defined over 𝔽 p . The trace of the Frobenius of E is known up to sign and we need a fast way to find this sign, in the context of the Elliptic Curve Primality Proving algorithm (ECPP). For this purpose, we propose to use the action of the Frobenius on torsion points of small order built with class invariants generalizing the classical Weber functions.
OpenAlex reports 12 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Let ℰ / ℚ ¯ be an elliptic curve having complex multiplication by a given quadratic order of an imaginary quadratic field 𝕂 . The field of definition of ℰ is the ring class field Ω of the order. If the prime p splits completely in Ω , then we can reduce ℰ modulo one the factors of p and get a curve E defined over 𝔽 p . The trace of the Frobenius of E is known up to sign and we need a fast way to find this sign, in the context of the Elliptic Curve Primality Proving algorithm (ECPP). For this purpose, we propose to use the action of the Frobenius on torsion points of small order built with class invariants generalizing the classical Weber functions.
Key concepts: Mathematics, Elliptic curve, Twists of curves, Supersingular elliptic curve, Edwards curve, Complex multiplication, Schoof's algorithm, Modulo