Skip to main navigation Skip to search Skip to main content

Computing the cardinality of CM elliptic curves using torsion points

  • de l’École polytechnique (LIX)

Research output: Contribution to journal › Article › peer-review

6 Citations (Scopus)

Abstract

Let (formula presented) be an elliptic curve having complex multiplication by a given quadratic order of an imaginary quadratic field K. 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 Fp. 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.

Original languageEnglish
Pages (from-to)663-681
Number of pages19
JournalJournal de Theorie des Nombres de Bordeaux
Volume19
Issue number3
DOIs
Publication statusPublished - 1 Jan 2007
Externally publishedYes

Keywords

  • Class invariants
  • Complex multiplication
  • ECPP algorithm
  • Elliptic curves
  • Modular curves
  • SEA algorithm

Fingerprint

Dive into the research topics of 'Computing the cardinality of CM elliptic curves using torsion points'. Together they form a unique fingerprint.

Cite this