Please advise. Does the "Pollard's Kangaroo" method search for keys faster than the "Baby Step Giant Step (BSGS)" algorithm? Or do these methods have the same search speed?
It seems the tools you are using or looking for look like just a type of solver? Do you already have a few tools that you think you can use for recovering missing characters?
I only know one tool that can recover missing characters on WIF keys. The only problem is that it still does not support GPUs.
It is called the FinderOuter tool; if you are interested, you can find it here:
https://bitcointalk.org/index.php?topic=5214021.0I search a bit but I do not know if these could help to find missing characters, but it uses to brute force WIF keys check the two tool called
Bitcrack and Keyhunt-CUDA. They both support GPUs but CUDA only.
The Keyhunt Cuda uses BSGS, but for Bitcrack, I do not know if it uses BSGS or Pollard.
Thanks for the answer.
From what I managed to understand, the WIF key search has a very low speed.
Having a public key, it is much faster to search by HEX. I checked the speed of keyhunt BSGS, it will take a long time to search. 2 years.
I could not figure out the "Pollard's Kangaroo" method. Maybe it is faster? Is there any point in figuring this out? If it works slower than BSGS, then the topic can be closed.