Is that proved that breaking ECDSA as hard as solving ECDLP?

Asked Sep 13 '20 at 15:45

Active Sep 13 '20 at 15:45

Viewed 49 times

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

asked Sep 13 '20 at 15:45

Ruben

0 Answers0