# Small e

If $$e$$ is sufficiently small, the exponent is ineffective at encrypting $$m$$.

Let's say $$m^e\<N$$; in this case, we can simply take the $$e$$th root of $$c$$. For example, if $$e=3$$, then we can calculate $$m = \sqrt\[3]c$$.

If $$m^e > N$$ then this is a *bit* more secure, but we can progressively add more multiples of $$N$$ until the cube root gives us a valid answer:

$$
m = \sqrt\[3]{c + kn}
$$

### Python

In Python we can use the `gmpy3` `iroot` function:

```python
from gmpy2 import iroot

m = iroot(ct, e)
```


---

# 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://ir0nstone.gitbook.io/notes/cryptography/overview/public-exponent-attacks/small-e.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.