Hi!
In order to make some sense of the magic keyspace number, used in oclHashcat, i would like to ask you guys something.
Knowing the difference between "real keyspace" and "GPU hashcat keyspace", and scanning this forum for some time, gives me the idea that this is somewhat vague still. Using some practical examples, i would like to ask the working method of this procedure, since I can't make this up from the source code.
I ran a few different bruteforce length, using all ?a characters, like:
oclHashcat64.exe -a 3 -m 0 example0.hash ?a?a?a --keyspace
The following keyspaces are returned when using the lengths, named first in the list:
As can be seen in this example, the 5,6,7 lengthed ?a masks have the same base loop keyspace-length/max-restore-point. When running these commands on a system, the actual keyspace will be significantly larger, which will increase the work load from seconds/minutes to hours/days/weeks (depending on hardware of course).
Looking in the wiki, I can see some preference for processing these masks (https://hashcat.net/wiki/doku.php?id=mask_attack#output)
Dictionaries are a whole other deal in this, like explained in https://hashcat.net/forum/thread-3877-po...l#pid22009 . I am aware of this, and is not really related to my question at this moment.
The goal is to use chunking, to spend small amounts of time, spread over the whole day on idle machines, where we can limit the search time for example for 1 hour, but finish the provisioned keyspace-baseloop knowing the system speed. (so this is not using the max run time feature).
Finally the question (sorry for the long introduction):
When using the brute force method, what can be a good way to do some job chunking on a system, so I can run this on my two test machines at school, in parallel of each other?
If this use case is not clear enough, I can give some more explanation 0:-)
Thanks in advance!
In order to make some sense of the magic keyspace number, used in oclHashcat, i would like to ask you guys something.
Knowing the difference between "real keyspace" and "GPU hashcat keyspace", and scanning this forum for some time, gives me the idea that this is somewhat vague still. Using some practical examples, i would like to ask the working method of this procedure, since I can't make this up from the source code.
I ran a few different bruteforce length, using all ?a characters, like:
oclHashcat64.exe -a 3 -m 0 example0.hash ?a?a?a --keyspace
The following keyspaces are returned when using the lengths, named first in the list:
Code:
3: 9025
4: 857375
5: 81450625
6: 81450625
7: 81450625
8: 7737809375
9: 735091890625
10: 5287606593041As can be seen in this example, the 5,6,7 lengthed ?a masks have the same base loop keyspace-length/max-restore-point. When running these commands on a system, the actual keyspace will be significantly larger, which will increase the work load from seconds/minutes to hours/days/weeks (depending on hardware of course).
Looking in the wiki, I can see some preference for processing these masks (https://hashcat.net/wiki/doku.php?id=mask_attack#output)
Dictionaries are a whole other deal in this, like explained in https://hashcat.net/forum/thread-3877-po...l#pid22009 . I am aware of this, and is not really related to my question at this moment.
The goal is to use chunking, to spend small amounts of time, spread over the whole day on idle machines, where we can limit the search time for example for 1 hour, but finish the provisioned keyspace-baseloop knowing the system speed. (so this is not using the max run time feature).
Finally the question (sorry for the long introduction):
When using the brute force method, what can be a good way to do some job chunking on a system, so I can run this on my two test machines at school, in parallel of each other?
If this use case is not clear enough, I can give some more explanation 0:-)
Thanks in advance!