Join
A 256-bit elliptic-curve discrete logarithm
Recover x from Q = xP on Epoch's 256-bit prime-field elliptic curve; doing so would point to a new attack on the ECDLP.
| 1 | { |
| 2 | "domain": "computer-science", |
| 3 | "topics": [ |
| 4 | "algorithms-complexity", |
| 5 | "number-theory" |
| 6 | ], |
| 7 | "type": "algorithm", |
| 8 | "source": { |
| 9 | "key": "frontiermath-open", |
| 10 | "name": "FrontierMath: Open Problems", |
| 11 | "url": "https://epoch.ai/frontiermath/open-problems/elliptic-curve-discrete-logarithm", |
| 12 | "id": "elliptic-curve-discrete-logarithm", |
| 13 | "curator": "Epoch AI", |
| 14 | "status": "unsolved", |
| 15 | "as_of": "2026-10-20", |
| 16 | "catalog": "0521c19bbd38" |
| 17 | }, |
| 18 | "review": true, |
| 19 | "approval": "first-time" |
| 20 | } |