Pollard's kangaroo ECDLP solver

[MrFreeDragon]

-snip-
Perhaps there is an implementation in C++ or Python code?

A negative point is the same point only with a negative coordinate Y
In python i use operator.neg(point_y))%p then ordinary addplt

p in your case is modulo of the curve.
To be honest operation (p-y) is faster than (-y)%p/ I have just tested for random 100 million 256bit numbers just the subtraction (p-y) and division by modulo (-y)%p --> division by modulo took 1.4527 longer

[Etar]

Any body know if it is possible to know point is positive or negative? Or it is imposssible to know?

[HardwareCollector]

Any body know if it is possible to know point is positive or negative? Or it is imposssible to know?

Only after solving the DL for that point, otherwise it would be trivial to solve the DLP on that curve. In a way, there are no negative or positive points because of the modular group.

[Etar]

Any body know if it is possible to know point is positive or negative? Or it is imposssible to know?

Only after solving the DL for that point, otherwise it would be trivial to solve the DLP on that curve. In a way, there are no negative or positive points because of the modular group.

Agree that it will be trivial task to solve key, but not agree that  there are no negative or positive points.

Code:

#3-5=-2
#3
ptX=0xf9308a019258c31049344f85f89d5229b531c845836f99b08601f113bce036f9
ptY=0x388f7b0f632de8140fe337e62a37f3566500a99934c2231b6cb9fd7584b8e672
#5
ptsubX=0x2f8bde4d1a07209355b4a7250a5c5128e88b84bddc619ab7cba8d569b240efe4
ptsubY=0xd8ac222636e5e3d6d4dba9dda6c9c426f788271bab0d6840dca87d3aa6ac62d6

sub_point = (ptsubX, (p-ptsubY))
print ("sub_point= (%x,%x)" % sub_point)

result = addpt((ptX,ptY),sub_point, p)
print ("result_point= (%x,%x)" % result)

result_point= (c6047f9441ed7d6d3045406e95c07cd85c778e4b8cef3ca7abac09b95c709ee5,e51e970159c23cc65c3a7be6b99315110809cd9acd992f1edc9bce55af301705)
As you can see Y coordinate is not the same as for 2, because 2 is
(c6047f9441ed7d6d3045406e95c07cd85c778e4b8cef3ca7abac09b95c709ee5,1ae168fea63dc339a3c58419466ceaeef7f632653266d0e1236431a950cfe52a)
So we can say that (c6047f9441ed7d6d3045406e95c07cd85c778e4b8cef3ca7abac09b95c709ee5,e51e970159c23cc65c3a7be6b99315110809cd9acd992f1edc9bce55af301705)
is negative point on curve and
(c6047f9441ed7d6d3045406e95c07cd85c778e4b8cef3ca7abac09b95c709ee5,1ae168fea63dc339a3c58419466ceaeef7f632653266d0e1236431a950cfe52a)
is positive. But any way if there no way to get sign it is no matter.

[arulbero]

Any body know if it is possible to know point is positive or negative? Or it is imposssible to know?

Only after solving the DL for that point, otherwise it would be trivial to solve the DLP on that curve. In a way, there are no negative or positive points because of the modular group.

Agree that it will be trivial task to solve key, but not agree that  there are no negative or positive points.

There are no negative or positive points, because -1 = n-1 mod n,  -1 'looks' negative and n-1 'looks' positive, but the point is the same.

It is not correct to think at this group like a line, it is more correct to think at it like a circle (that means 'modular' and 'cyclic group'). There are not concepts like "come before" or "follow", it doesn't make any sense say that a point P "comes before" Q , then there are no negative (before zero) or positive (after zero) points.

[Etar]

what i do not understand why zielar is not solve key yet..
with him power he can already done 4*sqrt(n) simply.
I left the race because I feel like something is wrong here.

[brainless]

what i do not understand why zielar is not solve key yet..
with him power he can already done 4*sqrt(n) simply.
I left the race because I feel like something is wrong here.

there is no negative no positive, there is reverse point in other zone, it is not important zone is connect each other, like pubkey for x is same as ffff....4140 but y is difrent till 128 bit range zone, if you see at last of 128 bit range, last key you match reverse in fff...128bit minus zone, very next key you cant match it in next zone, but i can calc where that key zone will be exist, for detail of experiment i will write with examples later

[HardwareCollector]

what i do not understand why zielar is not solve key yet..
with him power he can already done 4*sqrt(n) simply.
I left the race because I feel like something is wrong here.

It’s not a compute only problem. It’s a compute, storage, and network bandwidth problem when you place solving time constraints on large intervals. Hopefully after he solves it, he will disclose the resources used and any challenging issues that he had to overcome.

[arulbero]

#110 solved!!!

https://www.blockchain.com/btc/address/12JzYkkN76xkwvcPT6AWKZtGX6w2LAgsJg

[PietCoin97]

congratulation to the solver

[dextronomous]

congrats to the winner, what a man,
cheers from amsterdam, nl.

[Jean_Luc]

congrats to zielar

[MrFreeDragon]

Good job! Jean_LUc, your program is very good!
Did zielar confirmed he solved it? Congrats to him as well!

[COBRAS]

congrats to Zielar

[Jean_Luc]

https://github.com/JeanLucPons/Kangaroo/blob/master/DOC/keys110.jpg

Well done !

[HardwareCollector]

Congratulations to @Zielar

[BitCrack]

Congratulations to solver.

Maybe I will release mine now that I have no hope of finding any keys with it.

[COBRAS]

https://github.com/JeanLucPons/Kangaroo/blob/master/DOC/keys110.jpg

Well done !

On the screen kangaroo 1.9alpha. On Github only 1.8 ((

How to download it ?

[PietCoin97]

Insider kangaroo for test for Zielar

[WanderingPhilospher]

https://github.com/JeanLucPons/Kangaroo/blob/master/DOC/keys110.jpg

Well done !

On the screen kangaroo 1.9alpha. On Github only 1.8 ((

How to download it ?

just recompile the files that are there and yours will show 1.9alpha.