CM (complex multiplication) method for generating elliptic curves

E1875395 UNEXPLORED

The CM (complex multiplication) method for generating elliptic curves is a number-theoretic technique that constructs elliptic curves with prescribed endomorphism rings, enabling the creation of curves with specific properties such as a desired number of points over a finite field, often for cryptographic applications.

Try in SPARQL Jump to: Surface forms Referenced by

All labels observed (2)

Label	Occurrences
CM (complex multiplication) method for generating elliptic curves canonical	1
Elliptic Curve Cryptography (ECC) Brainpool Standard Curves and Curve Generation	1

Referenced by (2)

Full triples — surface form annotated when it differs from this entity's canonical label.

Schoof–Elkies–Atkin (SEA) point-counting algorithm → usedIn → CM (complex multiplication) method for generating elliptic curves ⓘ

RFC 5639 → title → Elliptic Curve Cryptography (ECC) Brainpool Standard Curves and Curve Generation ⓘ

linked to: CM (complex multiplication) method for generating elliptic curves