In cryptography, the Elliptic Curve Digital Signature Algorithm offers a variant of the Digital Signature Algorithm which uses elliptic-curve cryptography.

Elliptic curve scalar multiplication is the operation of successively adding a point along an elliptic curve to itself repeatedly.

In algebraic geometry, supersingular elliptic curves form a certain class of elliptic curves over a field of characteristic p > 0 with unusually large endomorphism rings.

In mathematics, elliptic curve primality testing techniques, or elliptic curve primality proving, are among the quickest and most widely used methods in primality proving.