02-12-2017, 08:08 AM
This approach is only advantageous if you know e.g. the exact algorithm used to produce the random numbers and know the algorithm has some flaw you can exploit to attempt to predict the numbers. Otherwise the keyspace is still the same, except now you're just pissing in the wind. Well, you're pissing in the wind regardless since the keyspace is impossible. But the probability of you "getting lucky" is not any more likely than going sequentially or using markov chains or something.
Also ?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d isn't even a valid mask for Hashcat, as it's greater than 2^64 - 1. So in one regard, streaming candidates into hashcat is a valid approach to work around the uint64 limitation. But on the other hand, it's fruitless to even attempt to brute force this keyspace since it's impossibly large. So the workaround is still for naught.
This thread is braindead no matter how you slice it.
Also ?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d?d isn't even a valid mask for Hashcat, as it's greater than 2^64 - 1. So in one regard, streaming candidates into hashcat is a valid approach to work around the uint64 limitation. But on the other hand, it's fruitless to even attempt to brute force this keyspace since it's impossibly large. So the workaround is still for naught.
This thread is braindead no matter how you slice it.