02-24-2018, 06:51 AM
(02-15-2018, 10:30 AM)philsmd Wrote: If the keyspace of the mask that you want to duplicate is very slow (as in your case just 10000 password candidates), you could just store these password candidates to a dictionary file and use the dictionary and the duplicate rule in hashcat.For small keyspace,this can work.But I want to find a way that can support very large keyspace and the speed can be even as fast as the bruteforce attack since the dictionary attack still has too many limitations on disk space and speed .
e.g.
(or use maskprocessor instead)Code:hashcat --stdout -a 3 ?d?d?d?d > dict.txt
and
where the file duplicate.rule contains the duplicate rule (d)Code:hashcat -m 0 -w 4 -r duplicate.rule hash.txt dict.txt