When we restore searching from a saved work file, it only shows the first key in input file after the end range, so what happens to other keys we input for search?
And if we have a speed of 1000MK/s, it would divide by the number of keys right? meaning half the speed is used to search for the second key if we input 2 keys? If that is the case then the expected time should double if there is more than 1 key.
Thus having 4 keys to search for a 130 bit key could take up to 2**68 operations, correct?
This program cannot search for multiple keys simultaneously.
It will go over each key in the input file, one at a time.
If a solution is found then it goes to the next key.
Someone correct me if I'm wrong, but otherwise I think you need to use the
-m parameter to give up the search and go to the next key.