Re: Pollard's kangaroo ECDLP solver

if 260 pubkeys in 110bit, then how much time it will take ?

The quick and easy answer would be to look at how long it took to solve #110...roughly 2 days. You could take the 2 days and times that by 260 to get a quick and easy answer however, we know that the tames generated while searching for each pubkey would be used/valid for each subsequent pubkey. I think if one had 260 GPUs, each searching for 1 of the 260 pubkeys, and doing a daily merge/collision check, it would be much faster than the 2 x 260 days, but no way to be 100% certain.

Are all 260 in the 110 range?

16 out of 260 will be in 110bit range

Why are you searching 16 pubkeys at once in 110bit when there's only one pubkey for #110?

Runtime increases linearly with respect to the number of pubkeys, and when solving 1 pubkey, the runtime is already exponentially high, so you can't really find pubkeys quicker by batching them together in the same command invocation.

Brainless is not looking for pubkey #110; he is looking for #120's pubkey inside 2^110 range via shifting #120's pubkey. Ultimately he has shrank the range by a factor of 2^10 = 1024 but needs to run the program for each pubkey or integrate runs with the 260 pubkeys.