Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with arithmetic-geometry
Search options not deleted
user 39521
Diophantine equations, rational points, abelian varieties, Arakelov theory, Iwasawa theory.
31
votes
Is there any theory why (for Bitcoin) the discrete logarithm problem is so hard to solve?
Yes. I'll talk about why elliptic curve discrete log is harder than ordinary discrete log.
Suppose we have $g, h$ and want to find $n$ such that $g^n = h$.
The usual methods for solving the discrete …
- 12.4k