Useful and efficient algorithms for secp256k1 elliptic curve
In this article, we will consider several useful and efficient algorithms for an elliptic curve E over a field GF(p) given by the short Weierstrass equation у^2 = х^3 + Ах + В Algorithm for generating a point on curve E Algorithm for adding points Doubling Point Algorithm Algorithm for finding an integer multiple point Algorithm for finding an integer multiple point (scalar multiplication)…
