06-21-2013, 07:01 PM
(06-21-2013, 05:33 PM)mastercracker Wrote: Your post lack a little bit of details but if I get it right, you want to make all the combinations of 2 lists and then apply rules to them. Using -a 1 won't work. The workaround is to "rulify" your second list. For example, if the second list contains the following words:
how
rule
combination
then you create the file 2.rule containing this:
$h$o$w
$r$u$l$e
$c$o$m$b$i$n$a$t$i$o$n
Then you use -a 0 with your first wordlist then -r 2.rule then -r other.rule
Ok that sounds like it would work, but would be a lot of work. I was hoping to apply a generic rule supplied with hashcat to one or both of the dictionaries on a combinator attack. So for example I apply passwordspro rules, which does a bunch of transforms and additions, etc, to a word. The idea being it does that to the lists in both dictionaries as the combinations are being tried.
For example, if I had a rule that tried a list as is and also uppercases all the words I would expect combinations like this. My 1st dictionary would contain the words: password, server, and backup. My second dictionary would be the same.
I would see combinations
passwordpassword
passwordserver
passwordbackup
serverpassword
serverserver
serverbackup
backuppassword
backupserver
backupbackup
PASSWORDPASSWORD
PASSWORDSERVER
PASSWORDBACKUP
SERVERPASSWORD
SERVERSERVER
SERVERBACKUP
BACKUPPASSWORD
BACKUPSERVER
BACKUPBACKUP
It would add potentially a ton of combinations, but would work for smaller word lists.