Paid Rules Assistance?

[philsmd]

combining 3 dicts is essentially the same as combining 2 dicts and "add" the dict again (1+1+1 = (1+1)+1 = 3).

you could use combinator3.bin from hashcat-utils (https://hashcat.net/wiki/doku.php?id=has...ombinator3 , https://github.com/hashcat/hashcat-utils , https://github.com/hashcat/hashcat-utils/releases).

you could also (as mentioned) combine just 2 dicts (as a pre-computation step and save it to disk) and use -a 1 (combinator attack) to "add" the second combination.

If the total number of words is small (even if combined 3 times n * n * n == n^3 ), the best approach could be to pre-compute this large dict already to be able to use -a 0 together with -r in hashcat (there are alternatives with --stdout/pipe/stdin etc if the total combination is too large, but you still need to use rule files -r ).

The rules could look something like this (see https://hashcat.net/wiki/doku.php?id=rule_based_attack):

Code:

:
si1
se@
so0

si1 se@
si1 so0
se@ so0

si1 se@ so0

There are also other example of leet rule in hashcat's rule folder:
rules/Incisive-leetspeak.rule (https://github.com/hashcat/hashcat/blob/...speak.rule)
rules/leetspeak.rule (https://github.com/hashcat/hashcat/blob/...speak.rule)
rules/unix-ninja-leetspeak.rule (https://github.com/hashcat/hashcat/blob/...speak.rule)

but of course these are much more advanced rules and might be too many rules depending on how large your word list already is etc... Furthermore, several rule files for instance do not have the "se@" rule (actually this is quite uncommon normally you would replace "a" with "@", if at all)... so maybe a custom rule file could be best if you know exactly what needs to be replaced