05-18-2013, 10:58 PM
I had this idea the other day but am wondering how to generate a wordlist/pipe it into hashcat.
Let's say you have a series of hashes, all of which have a 10 digit number as the input. Assuming the numbers are randomly generated, the probability of a single digit being 0-9 is 1/10. The probability of two of the same digits next to each other is 1/100, 3 digits is 1/1i000, and so on.
I first though permute could do this. While it generates all the permutations of 1234567890 just fine, there are duplicates when repeating one of the numbers(eg. 1224567890). If all 90+1 permutations for no repeating digits+1 repeating digits are calculated, that's 3.3 billion, clearly far too many duplicates.
My question is basically, any way to generate numbers where the least repeated digits are generated first?
Let's say you have a series of hashes, all of which have a 10 digit number as the input. Assuming the numbers are randomly generated, the probability of a single digit being 0-9 is 1/10. The probability of two of the same digits next to each other is 1/100, 3 digits is 1/1i000, and so on.
I first though permute could do this. While it generates all the permutations of 1234567890 just fine, there are duplicates when repeating one of the numbers(eg. 1224567890). If all 90+1 permutations for no repeating digits+1 repeating digits are calculated, that's 3.3 billion, clearly far too many duplicates.
My question is basically, any way to generate numbers where the least repeated digits are generated first?