Joining 2 dictionaries together without bruteforcing one side

[bsec]

Hi,
first of all in my post i've used the attached adj.txt & noun.txt ( that's all what i've found )

$ wc -l adj.txt noun.txt
1830 adj.txt
2396 noun.txt
4226 total

1- i've combined adj.txt & noun.txt using combinator.bin from hashcat utils, and used a perl script to check if length of the result is >= 5 & <= 61 (cause wpa password is between 8 (5+3) and 64 (61+3) the 3 is the 3 digit number that we'll be adding them to the generated plains ), the command i've used:

$ ./combinator.bin adj.txt noun.txt | perl -ne'if (length($_) >= 5 && length($_) <= 61' > com.list

theoretically, there's 1830*2396 = 4384680 combination without applying the length rule, after using the length rule:

$ wc -l com.list
4384680 com.list

the result still the same cause the aren't any combined work < 6 and > 61 in my lists.
2- creating the rule that would append the ?d?d?d for every word from com.list.
i've used maskproccesor to create it:

$ ./mp32.bin "$"?d"$"?d"$"?d > 1000.rule

3- launching the attack:

./hashcat-cli32.bin -m 2500 -r 1000.rule com.list test.hccap

assuming that you're running the attack at speed of 500,000 h/s,
the time of running would be:
4384680000/(500000*3600) = 2.43 hour.
4384680000 is the number of plains that would be tested.
btw you could used the same attack by using hybrid attack mode, and piping the result of combinator.