Elliptic Curve y² = x³ + ax + b: Group Law & Bézout's…

What is an Elliptic Curve?

An elliptic curve defined by the equation $y^2 = x^3 + ax + b$ over a field (such as the real or complex numbers) is a smooth, projective algebraic curve of genus one with a specified point O. This curve can be visualized as a doughnut shape in three-dimensional space.

The points on an elliptic curve form an abelian group under a geometric operation known as the chord-and-tangent law, which allows us to add two points P and Q on the curve to get another point R.

Bézout's Theorem and Intersection Points

Bézout’s theorem is a fundamental result in algebraic geometry that states the number of intersection points between two curves, counted with multiplicity, is equal to the product of their degrees. For an elliptic curve, this means any line can intersect the curve at most three times.

Given two distinct points P and Q on the elliptic curve, the third point R where a secant or tangent line intersects the curve (if extended) is uniquely determined by Bézout’s theorem.

live demo · related simulation● LIVE

The Elliptic-Curve Group Law

The group law on an elliptic curve allows us to define addition of points in a way that respects the algebraic structure. If P and Q are two distinct points, their sum R is found by drawing the line through P and Q (if they are not equal) or tangent at P if they are equal, and then finding its third intersection with the curve.

If P = Q, we use the tangent to the curve at point P. The group law ensures that this operation is associative, has an identity element O (the point at infinity), and every point has an inverse.

Applications in Cryptography

Elliptic curves are widely used in cryptography because the discrete logarithm problem on elliptic curves is believed to be computationally infeasible. This makes them a cornerstone of modern cryptographic protocols such as Elliptic Curve Diffie-Hellman (ECDH) and Elliptic Curve Digital Signature Algorithm (ECDSA).

The security of these systems relies on the difficulty of finding discrete logarithms, which is significantly harder than factoring large integers or solving other problems in number theory.

Frequently asked questions

What is a secant line in this context?

A secant line through two points P and Q on an elliptic curve intersects the curve at these points and possibly another point R, which helps define the group law.

How does Bézout’s theorem apply to elliptic curves?

Bézout’s theorem ensures that any line can intersect an elliptic curve in at most three points, allowing for a well-defined third intersection point when adding two points on the curve.

Why are elliptic curves important in cryptography?

Elliptic curves provide a secure basis for cryptographic algorithms because solving the discrete logarithm problem on them is computationally difficult, making them ideal for encryption and digital signatures.

Can any two points be added using the group law?

Yes, if P and Q are distinct points, their sum R can be found by drawing a line through P and Q. If P = Q, we use the tangent at P to find its third intersection with the curve.

Try it live

Everything above runs in your browser — open Elliptic Curve y² = x³+ax+b — Group Law & Bézout's Theorem and change the parameters while it is running. Nothing is installed, nothing is uploaded, the whole model lives in one tab.

▶ Open Elliptic Curve y² = x³+ax+b — Group Law & Bézout's Theorem simulation

Elliptic Curve y² = x³ + ax + b: Group Law & Bézout's Theorem