07-24-2021, 04:15 AM
(07-24-2021, 03:12 AM)royce Wrote: I don't have a hashcat-only solution for you, but something like this might work - basically, append that separate to all your words, and then use a rule that *removes* the final separator from the string.
https://gist.github.com/roycewilliams/18...45692bccc2
And if that's too slow (for faster hashes), you can use a file containing rules that append the the words.
If I am reading this correctly, this is the syntax they used in total:
pp64 --elem-cnt-min=2 --elem-cnt-max=2 \
<(LC_ALL=C sort -u dict1 dict2 dict3 | 's/^/ /') \
| hasht -m 100 -a 0 hashes.txt -r prince-twoword-infix-simulator.rule
I'm usually good at picking out variables in things and swapping them out with what I need. I get most of this. It starts off with element count min max, not clear on the LC_ALL portion of it though. The last line makes sense enough.
One other issue I have though, is I don't know exactly how many words. Could be four words, could be seven.