0
$\begingroup$

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

$\endgroup$
2
  • $\begingroup$ Does this answer help? $\endgroup$
    – ckamath
    Commented Sep 13, 2020 at 23:07
  • $\begingroup$ not it is not proved such a thing. ECDSA (or DSA) can break (under some special conditions) by avoiding to solve ECDLP (or DLP resp.). For instance if you know "some" contiguous bits of secret and ephemeral keys of polynomial many signatures you can break ECDSA without solving ECDLP. $\endgroup$
    – 111
    Commented Sep 13, 2020 at 23:13

0