I have a hash I want to work with, and it is 13 numbers, 0-12, in random order, non-repeating, separated by hyphens, and enclosed on either side by braces.
For example:
[5-10-3-0-2-7-11-9-6-8-1-12-4]
I have already dumped all 6.2 billion combinations to a series of text files via a PHP script. After reading oclHashcat documentation today, I see it can do permutations, and it can do mask attacks. Can they be combined? An internal perm/mask attack would be worlds faster than reading in 166 GIGABYTES of text files. I cant imagine I'd get any GPU efficiency that way.
Is that type of attack possible?
For example:
[5-10-3-0-2-7-11-9-6-8-1-12-4]
I have already dumped all 6.2 billion combinations to a series of text files via a PHP script. After reading oclHashcat documentation today, I see it can do permutations, and it can do mask attacks. Can they be combined? An internal perm/mask attack would be worlds faster than reading in 166 GIGABYTES of text files. I cant imagine I'd get any GPU efficiency that way.
Is that type of attack possible?