Show Posts
I have other question. I want for fun reduce puzzle key #125 to total of 100 bits. Can anyone tell me the steps? AND tell me if this is actually possible? lol..
I know i will land on tons new pub keys but is there a program that reduce bits ?
I know i will land on tons new pub keys but is there a program that reduce bits ?
you can try fraction-bsgs or fraction-kangaroo it do what you need.Step1 substruct range begin from public key
Step2 devide G by 2^24, it will be fraction
Step3 devide public key by 2^24, it was first public key to serach in range 1.. 2^100
Step4 substuct fraction from first public key , it wil be second public key to search
Step5 substruct fraction from second public key.......
In simple numbers how it work. For ex. our desired key is 379 that lie in range 2^9
We want search in range 2^6=64, divisor is 2^3=8
Devide 379/8 = 47,375
fraction = 1/8 = 0,125
Stage 0 search 47,375 in range 2^6 => result negative
Stage 1 subtract from it 0,125 => 47.25, search in range 2^6 => result negative.
Stage 2 subtract from it 0,125 => 47.125, search in range 2^6 => result negative.
Stage 3 subtract from it 0,125 => 47, search in range 2^6 => result positive.
So now we need multiply 47 by divisor 2^3=8 = 376 and add stage number =>376 +3 = 379
Desired key 379 founded in 3 stage of 8
From myself that if you are not lucky, then this is a bad idea, very bad idea.
With kangaroo puzzle#125 need +/- 2^63 op.
With division you will have 2^24 public keys with search range 2^100 that need 2^51 op (maxstep 2) for every pub.
Total 2^24*2^51=2^75 op and this is not a guarantee that the key will be found due to maxstep.
