> 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/digital-signatures/ecdsa-prerequisites/discrete-logarithm-problem-with-elliptic-curves.md).

# Discrete Logarithm Problem with Elliptic Curves

Consider an elliptic curve $$E$$, with generator $$G$$ and another element $$T$$. Then DLP is finding $$d$$, such that

> $$G+G+G+...+G$$ $$(d \ times)$$ $$= d\*G = T$$

To understand the practical implications, we visualize this geometrically on the curve $$E$$ :- we first find generator $$G$$ on $$E$$, then add $$G$$ to it to locate $$2G$$.

This is considered the first hop (computationally, it is executing the group operation). Then, we add $$G$$ again to mark the value of $$3G$$, which is the second hop. By repeating this process, $$d$$ times, we finally reach point $$T$$ on the curve $$E$$.

As it turns out, finding the number of hops is computationally hard.

![](https://3421145409-files.gitbook.io/~/files/v0/b/gitbook-x-prod.appspot.com/o/spaces%2FRTEKu4E7Fvtss3GI9CYU%2Fuploads%2Fgit-blob-5ae243279ee6b36d0009ec1571012e5c8d6e2d29%2FBSVA-DigitalSignatures-Chapter2-Image009.gif?alt=media)

So, the starting point is known for elliptic curves, i.e., the generator $$G$$, the final point is known, $$T$$, then DLP is essentially to find the number of hops taken to reach $$T$$ from $$G$$.

<mark style="background-color:orange;">IMPORTANT</mark> Note - for elliptic curves, we use the discrete logarithm problem as:

> $$d$$ is private key and $$T$$ is the public key\
> $$d=K\_{pr}$$ - an integer, which is the number of hops in above explanation\
> $$T = dG = K\_{pub}$$ This is a point on curve $$E$$, i.e., group element, i.e., it has an $$x$$ and $$y$$ co-ordinate so $$T = ( x\_T, y\_T )$$

As we define $$d$$ as the private key and $$T$$ as the public key, the practical implication of the above is that given a known public key, it is very hard to compute the private key.

*Terminology note* - Generator is also commonly referred to as "base point", so $$G$$ is a base point for curve $$E$$.

**Credits**

Special thanks to Prof. Christof Paar for providing a fantastic [Introduction to Cryptography](https://www.youtube.com/channel/UC1usFRN4LCMcfIV7UjHNuQg).


---

# 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/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.
