Pollard's kangaroo ECDLP solver - page 53.

unclevito

jr. member

Activity: 76

Merit: 4

Quote from: bigvito19 on May 29, 2021, 06:32:17 AM

I got an RTX 2060 GPU. I was testing it using Jean_Luc's vanitygen and kangaroo. With the vanitygen the speed was at least +900 MKeys and the kangaroo speed was doing between 500 and 600 MKeys. Is this normal or do I have the wrong configuration with kangaroo?

So is the hex private key located at one specific point in the range which equals the hex private key address or is the key spread out and is the addition of different points in the range. If the latter it would not make sense to search in portions of the entire range like dividing the search into 0 through F individually

unclevito

jr. member

Activity: 76

Merit: 4

If the address has never sent bitcoin then the public key is unknown and you either need to use bitcrack or altcrack to search with the public address or ripemd160.

Desyationer

newbie

Activity: 34

Merit: 0

How to convert adress of 30btc puzzle to public keys for kangaro?, adress not work

fxsniper

member

Activity: 406

Merit: 47

Quote from: Samrita on June 03, 2021, 02:07:52 AM

I want to add a condition to the parity to determine the direction of the jump.

if you can code
kangaroo.exe source code on github
you can fork to modify it as you want

Samrita

newbie

Activity: 7

Merit: 0

I want to add a condition to the parity to determine the direction of the jump.

NotATether

legendary

Activity: 1568

Merit: 6660

bitcoincleanup.com / bitmixlist.org

Quote from: nikolai7711 on June 02, 2021, 05:54:42 AM

Hello,people.Is this setting searching randomly for the priv key of an address :
Kangaroo.exe -ws -w texgen.work -wi 30 in.txt? If not.how can i try my luck with random search? Is there any command?

The normal mode technically is a pseudorandom search. It iterates through points chosen in a deterministic but very complex way because that's how the Pollard Kangaroo algorithm works.

nikolai7711

newbie

Activity: 4

Merit: 0

Hello,people.Is this setting searching randomly for the priv key of an address :
Kangaroo.exe -ws -w texgen.work -wi 30 in.txt? If not.how can i try my luck with random search? Is there any command?

NotATether

legendary

Activity: 1568

Merit: 6660

bitcoincleanup.com / bitmixlist.org

Quote from: bigvito19 on May 29, 2021, 06:32:17 AM

I got an RTX 2060 GPU. I was testing it using Jean_Luc's vanitygen and kangaroo. With the vanitygen the speed was at least +900 MKeys and the kangaroo speed was doing between 500 and 600 MKeys. Is this normal or do I have the wrong configuration with kangaroo?

Sounds about right to me. Vanitysearch is always going to appear faster than Kangaroo because of the former's use of endomorphisms to check several privkeys at once.

bigvito19

full member

Activity: 706

Merit: 111

I got an RTX 2060 GPU. I was testing it using Jean_Luc's vanitygen and kangaroo. With the vanitygen the speed was at least +900 MKeys and the kangaroo speed was doing between 500 and 600 MKeys. Is this normal or do I have the wrong configuration with kangaroo?

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Quote from: jmizarob on May 27, 2021, 11:52:24 PM

Quote from: WanderingPhilospher on May 27, 2021, 08:37:41 PM

Quote from: GoldTiger69 on May 27, 2021, 07:07:27 PM

Quote from: jmizarob on May 27, 2021, 06:07:35 PM

Out of curiosity, I was testing a range 0-FFFFFFFFFFFF and found the private key very quickly. I then proceeded to test the next range 1000000000000-1FFFFFFFFFFFF of equivalent size but with a public key of the first keyspace. It still managed to solve for the private key, even though the private key wasn't in the range provided. It took about 5 minutes. Why is that?

Maybe because the range is very small? And how come it found a key that wasn't there? That's a contadiction Wink

A lesser key is always in a larger range.

lesser range = 0-FFFFFFFFFFFF

greater range = 1000000000000-1FFFFFFFFFFFF

Let's say priv key to pub key is 3103FFCB8A82

This program always starts from 0. So if user enters the range of:
1000000000000:1FFFFFFFFFFFF

the program automatically subtracts the beginning range and shifts the pub key accordingly, in this case it subtracts and shifts by 1000000000000; so the program is actually searching from:
0:FFFFFFFFFFFF

If pubkey is found, the program calculates key like so: Tame D - Wild D + (original beginning range) 1000000000000

Makes perfect sense! Just not very efficient for finding that lesser private key. I wonder if that could be optimized?

The optimization is...don't search in a larger range for a key you know is in a smaller range, like you did. Like you said, when you searched in the smaller range it was found rather quick.
But the good news is, you know the program can find a key in a lesser range, even if your inputted range is greater.
Try running the program again with greater range with lesser key and see if it takes 5 minutes every time.
Remember, Pollard's Kangaroo/Lambda is designed to find a key in a known range (a, b).

jmizarob

newbie

Activity: 2

Merit: 0

Quote from: WanderingPhilospher on May 27, 2021, 08:37:41 PM

Quote from: GoldTiger69 on May 27, 2021, 07:07:27 PM

Quote from: jmizarob on May 27, 2021, 06:07:35 PM

Out of curiosity, I was testing a range 0-FFFFFFFFFFFF and found the private key very quickly. I then proceeded to test the next range 1000000000000-1FFFFFFFFFFFF of equivalent size but with a public key of the first keyspace. It still managed to solve for the private key, even though the private key wasn't in the range provided. It took about 5 minutes. Why is that?

Maybe because the range is very small? And how come it found a key that wasn't there? That's a contadiction Wink

A lesser key is always in a larger range.

lesser range = 0-FFFFFFFFFFFF

greater range = 1000000000000-1FFFFFFFFFFFF

Let's say priv key to pub key is 3103FFCB8A82

This program always starts from 0. So if user enters the range of:
1000000000000:1FFFFFFFFFFFF

the program automatically subtracts the beginning range and shifts the pub key accordingly, in this case it subtracts and shifts by 1000000000000; so the program is actually searching from:
0:FFFFFFFFFFFF

If pubkey is found, the program calculates key like so: Tame D - Wild D + (original beginning range) 1000000000000

Makes perfect sense! Just not very efficient for finding that lesser private key. I wonder if that could be optimized?

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Quote from: GoldTiger69 on May 27, 2021, 07:07:27 PM

Quote from: jmizarob on May 27, 2021, 06:07:35 PM

Out of curiosity, I was testing a range 0-FFFFFFFFFFFF and found the private key very quickly. I then proceeded to test the next range 1000000000000-1FFFFFFFFFFFF of equivalent size but with a public key of the first keyspace. It still managed to solve for the private key, even though the private key wasn't in the range provided. It took about 5 minutes. Why is that?

Maybe because the range is very small? And how come it found a key that wasn't there? That's a contadiction Wink

A lesser key is always in a larger range.

lesser range = 0-FFFFFFFFFFFF

greater range = 1000000000000-1FFFFFFFFFFFF

Let's say priv key to pub key is 3103FFCB8A82

This program always starts from 0. So if user enters the range of:
1000000000000:1FFFFFFFFFFFF

the program automatically subtracts the beginning range and shifts the pub key accordingly, in this case it subtracts and shifts by 1000000000000; so the program is actually searching from:
0:FFFFFFFFFFFF

If pubkey is found, the program calculates key like so: Tame D - Wild D + (original beginning range) 1000000000000

GoldTiger69

hero member

Activity: 583

Merit: 502

Quote from: jmizarob on May 27, 2021, 06:07:35 PM

Out of curiosity, I was testing a range 0-FFFFFFFFFFFF and found the private key very quickly. I then proceeded to test the next range 1000000000000-1FFFFFFFFFFFF of equivalent size but with a public key of the first keyspace. It still managed to solve for the private key, even though the private key wasn't in the range provided. It took about 5 minutes. Why is that?

Maybe because the range is very small? And how come it found a key that wasn't there? That's a contadiction Wink

jmizarob

newbie

Activity: 2

Merit: 0

Out of curiosity, I was testing a range 0-FFFFFFFFFFFF and found the private key very quickly. I then proceeded to test the next range 1000000000000-1FFFFFFFFFFFF of equivalent size but with a public key of the first keyspace. It still managed to solve for the private key, even though the private key wasn't in the range provided. It took about 5 minutes. Why is that?

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Quote from: bigvito19 on May 23, 2021, 06:00:53 PM

So what does 256 bits look like stored in a work file, I need to see an example.

AF4560D2458D74B963C5F3B7FD7A65ECF6A860C23BD1AC97B3A1121B2BC657D8 F1978DCDCDCDCC8D76C8C5DC5D85CD5C765C5D7C57D5C7D5C57D5C75D7C57D5C

256bits (space) 256bits

bigvito19

full member

Activity: 706

Merit: 111

So what does 256 bits look like stored in a work file, I need to see an example.

Robert_BIT

newbie

Activity: 33

Merit: 0

Quote from: NotATether on May 23, 2021, 04:28:13 PM

Quote from: Robert_BIT on May 23, 2021, 02:09:33 PM

Well it seems that each A100 is about 2.5 - 3 times faster than V100 so I won't even try for now. I have to ask my professor and it's going to be a pain accessing it anyway.

But it's interesting how computing power is basically the only thing required. I guess is just a matter of time until someone with access to a supercomputer might give it a try...

...and then get arrested like this guy? https://www.itnews.com.au/news/csiro-it-contractor-spared-jail-for-mining-monero-on-supercomputer-553535 Grin

On a more serious note, the software will have to improve to a level where it's not experimental before people start investing their resources into it.

Agree 100%. All sorts of people are resorting to crime, using resources without authorization, simply for profit. The reality is that it may very well work for a while but chances are statistically high that they will get a visit from the authorities. Anything related to crypto is by design built to leave 'some' traces. It's not a good business to steal computing power - whether that's for mining, things like this puzzle or anything related to crypto, really. They're just too many variables involved in terms of security and I'm not really sure who's dumb enough to think they will get away with it.

WanderingPhilospher

full member

Activity: 1162

Merit: 237

Shooters Shoot...

Quote from: NotATether on May 23, 2021, 04:28:13 PM

Quote from: Robert_BIT on May 23, 2021, 02:09:33 PM

Well it seems that each A100 is about 2.5 - 3 times faster than V100 so I won't even try for now. I have to ask my professor and it's going to be a pain accessing it anyway.

But it's interesting how computing power is basically the only thing required. I guess is just a matter of time until someone with access to a supercomputer might give it a try...

...and then get arrested like this guy? https://www.itnews.com.au/news/csiro-it-contractor-spared-jail-for-mining-monero-on-supercomputer-553535 Grin

On a more serious note, the software will have to improve to a level where it's not experimental before people start investing their resources into it.

What was the speed of your version? Wasn't it a lot slower than Jean Luc's?

So with your version people can store 256 bits in the work files, right? Is that the only difference?

If so, I am not sure why people are using yours, especially if it is slower than the original. If it is faster, I still don't know why they would use it for the puzzle since it will require more RAM/storage space.

Please enlighten me NotATether...I truly can't remember the speed and the differences in your version.

NotATether

legendary

Activity: 1568

Merit: 6660

bitcoincleanup.com / bitmixlist.org

Quote from: Robert_BIT on May 23, 2021, 02:09:33 PM

Well it seems that each A100 is about 2.5 - 3 times faster than V100 so I won't even try for now. I have to ask my professor and it's going to be a pain accessing it anyway.

But it's interesting how computing power is basically the only thing required. I guess is just a matter of time until someone with access to a supercomputer might give it a try...

...and then get arrested like this guy? https://www.itnews.com.au/news/csiro-it-contractor-spared-jail-for-mining-monero-on-supercomputer-553535 Grin

On a more serious note, the software will have to improve to a level where it's not experimental before people start investing their resources into it.

Robert_BIT

newbie

Activity: 33

Merit: 0

Well it seems that each A100 is about 2.5 - 3 times faster than V100 so I won't even try for now. I have to ask my professor and it's going to be a pain accessing it anyway.

But it's interesting how computing power is basically the only thing required. I guess is just a matter of time until someone with access to a supercomputer might give it a try...

Topic: Pollard's kangaroo ECDLP solver - page 53. (Read 58537 times)