# Assessment 3

### Discrete Logarithm Problem (DLP) is defined as...

#### Let p, β be elements of Z <sub>p</sub> \* with generator g, find x such that g <sup>x</sup> ≡ β mod p. What makes finding x computationally hard?

* [x] Computations are hard when p is large enough
* [ ] All DLPs are very easy to solve
* [ ] Cryptosystems use DLP as computers cannot solve it
* [ ] Time taken to solve DLP depends on finding logarithm value to base x


---

# Agent Instructions: Querying This Documentation

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

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://hub.bsvblockchain.org/higher-learning/bsv-academy/bitcoin-primitives-digital-signatures/ecdsa-prerequisites/assessment-3.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
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.