05-24-2012, 01:44 PM
Just to update this post for others in case they are interested in this subject.
Everything new to this thread was worked out by M@lik via PM, I am simply providing a follow up for the forum.
This method does indeed work but it is VERY slow, however the idea would dramatically reduce the cracking time if pre generated tables were made or if we can interest atom into making this some sort of GPU rule based option.
How to do it…
Download the sed.exe for windows here, there is no need to install cygwin.
Place maskprocessor, sed.exe and hashcatplus in the same directory and follow M@lik’s instructions above.
To change the amount of reoccurrence of a given character simply change the “\1†part. More means less filtering so \1\1\1\1\1\1 allows more repetitions than \1\1 for example.
Thanks to M@lik for all his hard work and if anyone else is interested in this method of optimising brute force would you please let atom know you would like this feature and we may be able to interest him enough to consider adding it.
Everything new to this thread was worked out by M@lik via PM, I am simply providing a follow up for the forum.
This method does indeed work but it is VERY slow, however the idea would dramatically reduce the cracking time if pre generated tables were made or if we can interest atom into making this some sort of GPU rule based option.
How to do it…
Download the sed.exe for windows here, there is no need to install cygwin.
Place maskprocessor, sed.exe and hashcatplus in the same directory and follow M@lik’s instructions above.
To change the amount of reoccurrence of a given character simply change the “\1†part. More means less filtering so \1\1\1\1\1\1 allows more repetitions than \1\1 for example.
Thanks to M@lik for all his hard work and if anyone else is interested in this method of optimising brute force would you please let atom know you would like this feature and we may be able to interest him enough to consider adding it.