python - Elliptic curve brute forcing -
i have parameter of elliptic curve. , coordinate of points q , p. want solve q=k*p (where k unknown) testing possible k.
so used class
then:
a=-1 b=0 p=134747661567386867366256408824228742802669457 curve = ellipticcurve(a,b,p) p=[18185174461194872234733581786593019886770620,74952280828346465277451545812645059041440154] q=[76468233972358960368422190121977870066985660, 33884872380845276447083435959215308764231090] in range(2902021510595963727029): result = curve.multpoint(i,p) if result[0]==q[0] , result[1]==q[1]: print (i) break is right approach solve problem?
this not approach because trying 2902021510595963727029 operations. if managed billion operations per second, take 92 thousand years finish.
you trying break security of ecdsa. if figure out way this, possible figure out ecdsa private key given corresponding public key. breakthrough in cryptography , famous. there many smart people have thought problem before , failed find solution.
the problem trying solve called discrete logarithm problem.
Comments
Post a Comment