<p>Is that proved that breaking ECDSA (Elliptic Curve Digital Signature Algorithm) as hard as solving ECDLP(Elliptic Curve Discrete Logarithm Problem)?</p>

CC BY-SA 4.0
2020-09-13T14:20:38.803Z
This is better suited for https://crypto.stackexchange.com/
Raghav Sood
CC BY-SA 4.0
2020-09-13T14:52:21.553Z
Yes, correct. Thank you. I'll remove from here.
Ruben
CC BY-SA 4.0
2020-09-13T15:04:07.960Z
I think it is fine here. libsecp is Bitcoin https://github.com/bitcoin-core/secp256k1
Michael Folkson
<cryptography><ecdsa>
Is that proved that breaking ECDSA as hard as solving ECDLP?
Ruben
# Is that proved that breaking ECDSA as hard as solving ECDLP?

(Asked by: username_0 on 2020-09-13)

Is that proved that breaking ECDSA (Elliptic Curve Digital Signature Algorithm) as hard as solving ECDLP(Elliptic Curve Discrete Logarithm Problem)?

**Tags:** cryptography, ecdsa

> **Comments:**
> **username_1**: This is better suited for https://crypto.stackexchange.com/  
> **username_0**: Yes, correct. Thank you. I'll remove from here.  
> **username_2**: I think it is fine here. libsecp is Bitcoin https://github.com/bitcoin-core/secp256k1  

---

## 0 answers

