# Part 1: What Are Elliptic Curves ?

As stated in its name, elliptic curve cryptography (ECC) is based on a particular kind of curve called an elliptic curve. The aim of this first post on ECC is to explain what elliptic curves are.

## Definition of elliptic curves

An elliptic curve is an abstract mathematical object generally defined as **"a smooth, projective, algebraic curve of genus one, with a specified point (O)."** This definition may seem complex, so let's break down the key terms:

* **Smooth**: A smooth curve is a curve that is free of singularities, such as cusps or self-intersections.
* **Projective**: A projective space is a fundamental geometric concept that generalizes the idea of euclidean space by adding "points at infinity," allowing for a unified treatment of lines, intersections, and perspectives.
* **Algebraic**: The curve consists of points that satisfy a polynomial equation.
* **Genus** : The genus of a curve is a topological invariant that, in intuitive terms, counts the number of "holes" in the curve.
* **Specified point (O)**: This is the invariant point, the point at infinity of the curve where every lines intersect.

<figure><img src="https://3366121826-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2Fdo9UTLEVhvOrL0zBVbm6%2Fuploads%2FrQhMdpYUdxO5y29nDgB7%2Fimage.png?alt=media&#x26;token=653e44b5-9bd9-4048-851b-a6f8c0b35fad" alt=""><figcaption><p><a href="https://pointatinfinityblog.wordpress.com/2016/04/11/points-at-infinity-i-projective-geometry/"><strong>Illustration of the Point at Infinity: A Railway Analogy</strong></a></p></figcaption></figure>

This definition alone doesn’t provide a clear picture of what an elliptic curve looks like. In practice, elliptic curves are usually introduced via their algebraic equation, along with the criteria mentioned above.

**Note:** Elliptic curves should not be confused with ellipses, which are a different type of curve known as conics.

<figure><img src="https://3366121826-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2Fdo9UTLEVhvOrL0zBVbm6%2Fuploads%2FbN73YUFFghCloULaBlBI%2Fimage.png?alt=media&#x26;token=ec92d067-b18e-49ef-9dca-77746f02e91b" alt=""><figcaption><p><em>Smooth curves (curves without singularities) in the cartesian plan with they algebraic equation.</em></p></figcaption></figure>

## Familly of elliptic curves

Elliptic curves can be defined by specific algebraic equations. There are several well-known families of elliptic curves, each with particular properties and applications. Let’s take a look at some of the most commonly used ones.

### Weirstrass curves

$$
y^{2} + a\_{1}xy + a\_{3}y = x^{3} + a\_{2}x^{2} + a\_{4}x + a\_{6} \quad \text{(Weierstrass form)}
$$

$$
y^{2} = x^{3} + ax + b \quad \text{(Weierstrass reduced form)}
$$

where $$a\_i$$ belongs to a field and the discriminant $$\Delta$$ (given by $$4a^3 + 27b^2$$ in the reduced form) is nonzero in  $$F\_p$$., defining an elliptic curve over $$F\_p$$. Every elliptic curve over  $$F\_p$$. can be converted to a short Weierstrass equation if  $$p$$.  is larger than 3.

<figure><img src="https://3366121826-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2Fdo9UTLEVhvOrL0zBVbm6%2Fuploads%2F848tcQpAvJFCG6e94Pe6%2Fimage.png?alt=media&#x26;token=f24763ef-46d7-4ee2-8bc5-3d563a2a827f" alt=""><figcaption><p><em>Weierstrass curve representation. The surrounding curves are not elliptic as they have a singularity point (cusp and a double point), i.e., Δ = 0.</em></p></figcaption></figure>

### Montgomery curves

$$
By^2 = x^3 + Ax^2 + x \quad \text{(Montgomery form)}
$$

where $$B(A^2 - 4)$$ is nonzero in $$F\_p$$, defining an elliptic curve over $$F\_p$$. Substituting $$x = Bu - \frac{A}{3}$$ and $$y = Bv$$ produces the short Weierstrass equation:

$$
v^2 = u^3 + au + b
$$

where

$$
a = \frac{3 - A^2}{3B^2}, \quad b = \frac{2A^3 - 9A}{27B^3}.
$$

Montgomery curves were introduced by Montgomery in 1987.

<figure><img src="https://3366121826-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2Fdo9UTLEVhvOrL0zBVbm6%2Fuploads%2F6sg9CIa3xaLE76CFuzCJ%2F2.png?alt=media&#x26;token=1fe122c2-0a0b-4a8b-8801-f4fdc306ef97" alt=""><figcaption><p>Montgomery <em>curve representation. The surrounding curves does not respect one of the</em> Montgomery <em>criteria</em> <span class="math">B(A^2 - 4)</span> <em>≠ 0.</em></p></figcaption></figure>

### Edwards curves

$$
y^{2} + x^{2} = 1 + dx^{2}y^{2} \quad \text{(Edwards form)}
$$

where $$d(1 - d)$$ is nonzero in  $$F\_p$$, defining an elliptic curve over  $$F\_p$$. Substituting $$x = \frac{u}{v}$$ and $$y = \frac{u-1}{u+1}$$ produces the Montgomery equation:

$$
Bv^2 = u^3 + Au^2 + u
$$

where

$$
A = \frac{2(1+d)}{1-d}, \quad B = \frac{4}{1-d}.
$$

Edwards curves were introduced by Edwards in 2007 in the case that $$d$$ is a fourth power. [SafeCurves ](https://safecurves.cr.yp.to/)requires Edwards curves to be complete, i.e., for $$d$$ to not be a square; complete Edwards curves were introduced by Bernstein and Lange in 2007.

<figure><img src="https://3366121826-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2Fdo9UTLEVhvOrL0zBVbm6%2Fuploads%2FQL88dMSjQRfERB8c2YmD%2FCapture%20d&#x27;%C3%A9cran%202025-04-25%20000255.png?alt=media&#x26;token=f417fb30-c938-41b3-a2ac-eadb57d6f23e" alt=""><figcaption><p>Edwards <em>curve representation. The surrounding curves does not respesct an Edwards criteria d(1-d)≠ 0.</em></p></figcaption></figure>

## Takeaways

This article laid one of the mathematical foundations of elliptic curve cryptography: the **elliptic curve** itself. If you had to explain what an elliptic curve is, here are two ways to do it:

1. **(Mathematician) Formal definition**: Give the rigorous mathematical definition (which, while accurate, is hard to remember and not very intuitive).
2. **(Engineer) Practical approach**:
   * Show how these curves look graphically.
   * Describe the algebraic equations that define them.
   * Clarify that they are not ellipses and belong to a different mathematical family.

In **Part 2** of this ECC series, we’ll explore **finite fields** and how elliptic curves are defined over them.
