01-31-2022, 10:44 PM
When I use Hashcat I use various types of attacks.
I use a mask attack for a small keyspace.
If that does not work I use a hybrid attack.
After another hybrid attack using different .rule files or a combo of .rule files.
When that does not work I maybe try a prince attack.
How do I avoid duplicate trials or overlap?
I noticed that when I do a mask attack for a small keyspace the hybrid attack sometimes includes doubles I already did with the mask attack.
I wonder what is the best way to manage the work already done, discard this from future attacks?
I also could not find a way to store ALL the hashes generated by hashcat, also the failed hashes for later re-use. How can I store each hash for later re-use?
I'd like to store the hashes in a file for later use in Hashcat on a different file and this way speed up the next attack. But I see the .pot file only stores cracked hashes. Not all of the hashes.
These questions are more related to planning but I feel I am not having the most efficient work method right now and I am looking for ways to improve this.
I use a mask attack for a small keyspace.
If that does not work I use a hybrid attack.
After another hybrid attack using different .rule files or a combo of .rule files.
When that does not work I maybe try a prince attack.
How do I avoid duplicate trials or overlap?
I noticed that when I do a mask attack for a small keyspace the hybrid attack sometimes includes doubles I already did with the mask attack.
I wonder what is the best way to manage the work already done, discard this from future attacks?
I also could not find a way to store ALL the hashes generated by hashcat, also the failed hashes for later re-use. How can I store each hash for later re-use?
I'd like to store the hashes in a file for later use in Hashcat on a different file and this way speed up the next attack. But I see the .pot file only stores cracked hashes. Not all of the hashes.
These questions are more related to planning but I feel I am not having the most efficient work method right now and I am looking for ways to improve this.