> For the complete documentation index, see [llms.txt](https://hub.bsvblockchain.org/llms.txt). Markdown versions of documentation pages are available by appending `.md` to page URLs; this page is available as [Markdown](https://hub.bsvblockchain.org/higher-learning/bsv-academy/bitcoin-primitives-digital-signatures/ecdsa-prerequisites/discrete-logarithm-problem-with-elliptic-curves.md).

# Discrete Logarithm Problem with Elliptic Curves

### The Problem

Consider an **elliptic curve E**, with a **generator point G** and another point **T** on the curve.

The **Elliptic Curve Discrete Logarithm Problem (ECDLP)** is:

* Find **d** such that:

**d × G = T**

Here, **d** is an integer, and **T** is the result of adding **G** to itself **d times**.

***

### Visualizing the Process

We can picture this geometrically:

1. Start with **G** on curve **E**.
2. Add **G + G = 2G** → the **first hop**.
3. Add **G again** → **3G** (the second hop).
4. Continue this process **d times** until reaching **T**.

👉 The challenge is that while **G** (the starting point) and **T** (the endpoint) are known, finding the exact number of hops (**d**) is **computationally hard**.

<figure><img src="https://3421145409-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2FRTEKu4E7Fvtss3GI9CYU%2Fuploads%2FrTeNwZM53jslOyKJvOW2%2Fcurve.gif?alt=media&amp;token=9132a5a0-d0cc-4ef9-b9b3-754854c780ac" alt=""><figcaption></figcaption></figure>

### Practical Implications

* In elliptic curve cryptography:
  * **Private key (Kₚᵣ)** = **d** (the number of hops).
  * **Public key (Kₚᵤᵦ)** = **T = d × G** (the point reached on the curve).
* Since **T** is a point on the curve, it has both **x** and **y** coordinates:\
  **T = (xₜ, yₜ)**
* Given **T (public key)**, it is extremely hard to compute **d (private key)**.

***

### Terminology

* The **generator G** is also called the **base point** of the elliptic curve.
* In practice:
  * Choose a secure elliptic curve **E**.
  * Select a base point **G**.
  * Private key = **d**.
  * Public key = **T = d × G**.

***

### Key Takeaway

The **Elliptic Curve Discrete Logarithm Problem (ECDLP)** underpins the security of elliptic curve cryptography:

* **Easy direction**: Compute **T = d × G**.
* **Hard direction**: Given **T** and **G**, recover **d**.

This one-way property is what makes elliptic curves secure for cryptographic applications like **ECDSA**.


---

# Agent Instructions
This documentation is published with GitBook. GitBook is the documentation platform designed so that both humans and AI agents can read, navigate, and reason over technical content effectively. Learn more at gitbook.com.

## Querying This Documentation
If you need additional information that is not directly available in this page, you can query the documentation by asking a question.

Perform an HTTP GET request on the following URL with the `ask` and `goal` query parameters:

```
GET https://hub.bsvblockchain.org/higher-learning/bsv-academy/bitcoin-primitives-digital-signatures/ecdsa-prerequisites/discrete-logarithm-problem-with-elliptic-curves.md?ask=<question>&goal=<user_goal>
```

`ask` is the immediate question: it should be specific, self-contained, and written in natural language.
`goal` is what the user is ultimately trying to achieve, the reason they need the answer. Sharing it helps GitBook give you a better, more relevant answer. A goal is most helpful when it describes the outcome the user wants rather than restating the question. For example, with `ask=how do I create an API token`, a goal like `automate deployments from our CI pipeline` lets GitBook tailor the answer to that use case.

The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.