GetFactorECM finds a factor of N using ECM factorization.

GetFactorPollardRho implements Pollard's Rho algorithm for fast prime factorization, but this function only returns one factor per call This function can fail and return m.

GetFactors returns all the prime factors of m.

NewRandomWeierstrassCurve generates a new random Weierstrass curve modulo N, along with a random point that lies on the curve.

RandInt generates a random Int in [0, max-1].

Point represents an elliptic curve point in standard coordinates.

Weierstrass is an elliptic curve y^2 = x^3 + ax + b mod N.