Telariust / pollard-kangaroo-c99

Pollard, kangaroo method, solving discrete logarithm problem (DLP) using pseudorandom walks, C99
21 stars 13 forks source link

multiple pubkeys #3

Open hamnaz opened 4 years ago

hamnaz commented 4 years ago

Again Question script work only 1 pubkey in bit range, if pubkey file set with switch -i pubkeys.txt ( where multiple pubkeys verify in bit range), it would be great

virus-cyber commented 4 years ago

Telariust ..multi pubkeys at once check inside bit range.. ..this script check only 1 pubkey in bit range.. ..but would it work does someone a test if multiple pub keys work?.. yes, only 1 "multi" check at the cost of "multi" drop in performance! (if u dont know, break_short has the same problem on Gigant-step calc) sry, but no

Telariust commented 4 years ago

I already answered you here https://github.com/Telariust/pollard-kangaroo/issues/3#issuecomment-530904845 and gave a script with saving progress for checking the list. I repeat, checking several public keys will lead to a proportional drop in performance. Pollard algo is not VanityGen or BitCrack, here we are not able to use one calculation for all. Because we are working with a public key, and not with its hash. It looks like bruteforce md5 with salt. For each public key, the calculation is unique and not applicable to another pubkey. This is a flaw. But there is an advantage - quadratic speed. when BitCrack compute 1M keys, its checked 1M keys when BSGS/Pollard compute 1M jumps, its checked (1M)^2 = 1000000M keys (!!!)

Suppose you already knew this, but really want to see it in the program. it’s not difficult to add .. like other improvements. minor functionality for user convenience is good. but I have not finished work on the main code, on speed and efficiency.

hamnaz commented 4 years ago

ok thankx for info, hope u will done best as much as you can, as most users looking gpu version

hamnaz commented 4 years ago

"Suppose you already knew this, but really want to see it in the program. it’s not difficult to add .. like other improvements. minor functionality for user convenience is good. but I have not finished work on the main code, on speed and efficiency."

it’s not difficult to add .. like other improvements.

pls add it, its required in my multi tests, also community waiting your GPU ver hope you will not release that till 110 puzzle solve, definatly you have rights to win first

hamnaz commented 4 years ago

Reminder !!!! " "Suppose you already knew this, but really want to see it in the program. it’s not difficult to add .. like other improvements. minor functionality for user convenience is good. but I have not finished work on the main code, on speed and efficiency."

it’s not difficult to add .. like other improvements.

pls add it, its required in my multi tests, also community waiting your GPU ver hope you will not release that till 110 puzzle solve, definatly you have rights to win first "