I am looking for a Python script or SageMath code implementation for testing the Baby Step - Giant Step
and Pollard Rho
algorithms on the secp256k1
curve.
I have read that these algorithms are well known for solving the ECDL problem for small numbers but I haven't found any code to test this.
edit:
I am looking for generating a small secret multiplier over the standard secp256k1 curve parameters.
Here is an example for E=EllipticCurve(GF(modi), [0,7])
using the standard NIST parameters for G
.
G=E(55066263022277343669578718895168534326250603453777594175500187360389116729240, 32670510020758816978083085130507043184471273380659243275938904335757337482424)
We know that for
P=E(69335761065767984070318781108127416310968753866933119760392423089576366173459, 113425617697416972613102767146321902225172329004525144463444008550345431352693)
when calculating discrete_log
we get the small x=24734216105351567
as a result of P = x * G
Is there any such implementation that will calculate the small x?
Thanks!