Can someone explain to me how to apply the discrete logarithm to elliptic curves? If I find a solution to the discrete log problem, how can I use that to crack Elliptic Curve Digital Signatures? I can see how they're similar in that the operate on groups, but I can't see how they would connect in application.
Any suggested reading would be much appreciated.
Any suggested reading would be much appreciated.
