Topic: Pollard's kangaroo ECDLP solver - page 86. (Read 59389 times)

Hello

Endomorphism perate 1rpivkeyPt/2 bytes * 2 !!! So endomorhpism not operate not split ranges.

Bro, this is

0000000000000000000000000000000000000000000000001xxxxxxxxxxxxxxx

a ranges for kids bro

what you say about ranges for ex

1000000000000000000000000000000000000000000000001xxxxxxxxxxxxxxx
4000000000000000000000000000000000000000000000001xxxxxxxxxxxxxxx
8000000000000000000000000000000000000000000000001xxxxxxxxxxxxxxx
F000000000000000000000000000000000000000000000001xxxxxxxxxxxxxxx

Yous see ? real keys are not 65 bytes bro

And "real deal"

Search in from

1000000000000000000000000000000000000000000000001xxxxxxxxxxxxxxx
to
FAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA

@COBRAS, this code is not going to help you the way you think it might. You still have to know the starting range in order for it to help you, and with larger ranges, it will not help you at all, even if you know the starting range. Large range in what I think you are looking at, 2^256...it will not help you so do not waste time using the code and searching. It's not going to split the range in half, so you will not go from 2^256 to 2^128.
Now, what it can do, and what I can do with it, is split search time dramatically with smaller ranges.
Anyone can challenge, set up a test. I've seen several posts stating it doesn't help reduce search time but it does.
Test:
Someone create a random private key in let's say this range:
(keep it small so it's not a long test)
Once you've generated the private key in that range, find the public key and post it here.
Running CPU only, I bet I can find the private key in half the time than it would normally take someone else just running Kangaroo alone. I will post results of my time versus anyone else's time, running Kangaroo only.
COBRAS, I just don't want you wasting any time thinking it will cut range in half. JP says there is a quick mod to increase the Kangaroo search range from 128 to 256. I'd ask him what to do code wise, versus doing anything else.
Someone post pub key in the
range. Let's go.

in test.bat address main addres 1EeAxcprB2PpCnr34VfZdFrkUWuxyiNEFv and -dp 6 and range 8000000000:ffffffffff
This mean that whole range devide into 32subranges. And each of this subranges in random way go to client.
So Task for client is find 1EeAxcprB2PpCnr34VfZdFrkUWuxyiNEFv but to prof of work, that client realy solve rubrange, server add 1 address randomly generated on the fly in this subrange.
So client get 2 address in each job. main address and pow address. And he need at worst case solve 1 address and in the best 2 address.
Once main key solved server creat winkey.txt file where put privat key and address. PK from pow keys never stored no where.
File xxx.txt created only on clientside and always deleted by client app.

hi there etar,

where does it get those 32 addressess. i mean it finds those 32 but writes one
at the end inside this file with a date and winkey.txt inside the default folder the test.bat.
so when run 1 time, at the end of those 32 can it show the keys saved inside the xxx.txt cause right
now nowhere the pkey for 31 of them to be found. is it.?
thanks man.

Maybe any one can share map file from crackServer?

OK, got it. Thanks for explaining.

Kangaroo did not know that you public key is out of range and will keep searching forever.
To stop searching use commands -m maxStep: number of operations before give up the search (maxStep*expected operation)
For ex if expected operation = 2^30 and -m 2 then Kangaroo will stop searching after 2^31 operations.

But be careful when choosing -m because the expected number of operations is with a 50% probability. Or it may be that your key will be found at 80% or even 90% and using -m can make it impossible.

Generally use a kangaroo only if you are sure that the key lies in this range!

Hello @Jean_Luc and dear forum members,

Thanks for this, I gave it a try with a 80bit range and it worked.

One question please. If the key/keys is out of range for the given PubKeys in the .txt file, is it suppose to stop and give an error? I tested this by searching out of range keys for 3 pubKeys and it kept searching for many hours without stopping or giving an error like "not found" or something. Isn't it supposed to stop once it finishes searching the range without finding the key? Again I'm referring o smaller ranges 70-80 bits and I use powerful Teslas. If the keys are in range it finds them but if they keys are out of range it just keeps going...Thanks.

Cheers,
Jorge

When work will be submit you wil see + scanned and message that pow key valid. in screen i can`t see that any client submit work.
Sould be like this.


Edit: here is link to map merger for crackServer https://drive.google.com/file/d/1zBsO6CUWgPQStPq1du6Yymdjx8aOqmFc
Source and precompiled exe file included. Also included map.bin file . If you have question let me know PM because i am already alot write here offtopic message.(sorry @JeanLuc  )

Bro, share please work files ??  All link what was in this thread for working files dead !!! And noone whant reupload then I ask.

??



Yes !!! Chachahca!!! 

one last question, why when the customer finishes the range and receives another job does not increase the scanned value but the buzzy value

https://imgur.com/jctfJtN

it might be interesting, afterwards is there the possibility to link my MAP file with yours?

i can also share my map file. it is not big around 70 solved subranges with -dp 20 but any way maybe it can help for some solve key faster then zielar.
I don`t like monopoly in all its manifestations.

ok, I understand thanks

It is no matter pow key solved or main key, xxx.txt wil be deleted.
If solved powkey then cleint app read content of xxx.file and wait while range will be solved.
After bitcrack will quit cleint app send content of xxx.file to the server to submit work.

if solved main key than client app send content to the server immediately.
If solved both key than you submit work + submit key, but any way xxx.file will be deleted from client.
Pow address need only to proof of work client, that he realy check subrange.
server do not save xxxx.txt file. He save only winkey.txt(by default) file where put address and Pk when main key solved.
Also server create database file named personal.db where saved work for each client.
you can use this data base file to pay reward for work(if you want).
DB file it is simple sqlite3 file. You can read it any sqlite viewer.

but the POW keys found and saved in xxx.txt on the server do not track us

file xxx.txt saved in the same folder as client app but it immediately deleted when any key solved(pow key or main key), and content of this file send to the server.
Once xxx.txt created by bitcrack client app read content, delete this file and send to the server.

Hi, where is the xxx.txt file saved?

About using Endomorphisms in Kangaroo. I think it is not give you result.
Why? becouse you need create new lambda wild herd and beta tame herd.
You get little bit more perfomance due to not point but arithmetic calculation x-coordinate of beta tame kangaroo betax = (x*beta)%p
Maybe I'm wrong, but the advantage there will be minimal.
I mean that betax will never colide with x-coordinate of simple wild DP
You need first create new lambda point from your pub and then produce wild DP from both points (simple pub and lambda point)
In this case x-tame can collide x-wild and x-betatame can collide x-lambdawild.

Simple example:
Range 2^ 64.0
Kangaroo >Expected OP 2^ 33.05491672361811 (n=0.5+math.sqrt(0.25-2*range*math.log(0.5))
So you need totaly calculate 2^ 33.0549 points.

BSGS>2^ 64.0 in worst case, in the best case unknown (dependency where PK lie) 
Ok, let`s for ex. PK lie in middle of the range, so you need calculate 2^ 63.0 points.
Of course you can say that you have a hash table on 2^36 points for ex. And you need only 2^63/2^36 = 2^27 operations.
But you already spent 2^36 operations to create this hashtable.