The main question in situations like yours is most of the time the same: how huge is the set of words, rules etc...
if you only have a few words + rules that you want to try, you could just precompute a new dictionary... the --stdout feature of hashcat can come very handy here (you could just use -a 6 --stdout base_words.txt ?d?d to compute a new dict with numbers appended)
on the other site, you could also think of using pipes/stdin mode (hashcat --stdout ... | hashcat -a 0 -m 0 ...)
or you could just use rule chaning (which is probably also very efficient and easy to use in your situation).... you can use multiple rule files and they are kind of "concatenated" (see https://hashcat.net/wiki/doku.php?id=rul...ulti-rules). hashcat even has some default/shipped rule files, e.g hashcat -a 0 -w 3 -O -m 0. -r rules/hybrid/append_d.rule -r rules/hybrid/append_d.rule -r my_custom_rules.rule hash.txt base_words.txt)
choose the one method that is fastest in your very PARTICULAR situation (again it depends mainly on the number of base words and rules, but also on the hash algorithm and total password candidate size, i.e. is it feasible and efficient to store/pre-compute a new dict or should this be done on-the-fly to avoid slow I/O i.e. disk bottleneck).
Good luck cracking
if you only have a few words + rules that you want to try, you could just precompute a new dictionary... the --stdout feature of hashcat can come very handy here (you could just use -a 6 --stdout base_words.txt ?d?d to compute a new dict with numbers appended)
on the other site, you could also think of using pipes/stdin mode (hashcat --stdout ... | hashcat -a 0 -m 0 ...)
or you could just use rule chaning (which is probably also very efficient and easy to use in your situation).... you can use multiple rule files and they are kind of "concatenated" (see https://hashcat.net/wiki/doku.php?id=rul...ulti-rules). hashcat even has some default/shipped rule files, e.g hashcat -a 0 -w 3 -O -m 0. -r rules/hybrid/append_d.rule -r rules/hybrid/append_d.rule -r my_custom_rules.rule hash.txt base_words.txt)
choose the one method that is fastest in your very PARTICULAR situation (again it depends mainly on the number of base words and rules, but also on the hash algorithm and total password candidate size, i.e. is it feasible and efficient to store/pre-compute a new dict or should this be done on-the-fly to avoid slow I/O i.e. disk bottleneck).
Good luck cracking