(06-03-2012, 12:56 AM)ntk Wrote: over 70GB then there is something missed out Hash-IT. Try the regex fillter on smaller charset. You will see how much it can save. Roughly 25-30% file size
This was just a "lite" filtering. I have just finished doing the second pass to see what I could get it down to, which is now 56.8GB.
This was done by filtering to 1 unique sequential character. However as Pixel proved this is a step to far with filtering.
I wish we didn't have to store these lists and could filter on the fly with GPU.
Hang on a second !!!!!
I have just had an idea !! We only need to generate 1 set of characters !
If this is right it will save a lot of time and space. All we are trying to achieve here is the sequence of characters not necessarily the characters themselves. Bear with me ....
Once we have .."A" in the sequence we need (no more than 1 sequential instance etc) all we have to do is use the rules to swap the characters about by using the substitution rule to make all the other patterns on the fly whilst cracking !
I think we just need the rules to move up 1 character (rather like the Ceaser cipher). So A will become B and C will be D etc.
All you need to do is think of the generated letters in the group of "A" as a pattern or rule file and not as the actual passwords.
Thoughts anyone ?