Sign and verify using the Elliptic Curve Digital Signature Algorithm

All inputs must be numbers, G(Gx,Gy) must be a point on the curve y²=x³+a*x+b mod p

d and k are optional but k must be relatively prime to the order of the point on the curve