As title says, I'm a first time user. I've read through the documentation and I understand how to run the program with its parameters and such. I can't seem to find in the documentation what I am trying to do and I was wondering if someone might be able to point me in the right direction.
I have a "password" of sorts with known length (145 combinations of 2 digit integers from -1 to 36 with spaces in between). Example:
The last 25 combinations are used as a form of "salt" in it's own sense. Crunching the numbers shows that there are (145 numbers)*(38 possibilities)*(2 digits per possibility) = 11,020 possibilities. I obviously know that this would be possible to solve using oclHashcat for MD5 (I forgot to mention it's MD5 encoded). I am wondering what I can do to indicate to oclHashcat that there are spaces after each combination of 2? Each one of the numbers also outputs after 30 seconds so if there might be a way to feed an "update" to oclHashcat indicating that the digits are known since this would exponentially decrease the amount of possibilities every 30 seconds.
I'm using oclHashcat for CUDA drivers on my GTX 970M. If someone could help me with known ways to do this, or point me in the right direction that'd be helpful!
P.S. I think my graphics card is good enough for this, but could someone aid me in figuring out how long it might take to break this hash?
I have a "password" of sorts with known length (145 combinations of 2 digit integers from -1 to 36 with spaces in between). Example:
Code:
17 -1 00 33 18 12 -1 20 12 -1 31 04 33 30 01 34 11 00 01 13 19 27 11 19 16 23 09 00 16 21 06 09 14 09 07 03 11 28 02 22 25 13 15 34 10 23 14 22 35 00 26 23 09 13 29 34 08 31 21 27 23 13 33 36 30 27 02 10 08 03 13 31 05 08 13 22 18 35 17 01 36 30 33 05 05 27 05 29 04 11 05 25 11 23 -1 34 08 16 04 24 14 10 34 03 10 15 33 20 25 04 12 18 13 00 34 30 26 33 36 24 22 20 29 28 13 18 01 35 00 30 21 32 06 28 08 35 04 16 21 33 24 08 25 22 12The last 25 combinations are used as a form of "salt" in it's own sense. Crunching the numbers shows that there are (145 numbers)*(38 possibilities)*(2 digits per possibility) = 11,020 possibilities. I obviously know that this would be possible to solve using oclHashcat for MD5 (I forgot to mention it's MD5 encoded). I am wondering what I can do to indicate to oclHashcat that there are spaces after each combination of 2? Each one of the numbers also outputs after 30 seconds so if there might be a way to feed an "update" to oclHashcat indicating that the digits are known since this would exponentially decrease the amount of possibilities every 30 seconds.
I'm using oclHashcat for CUDA drivers on my GTX 970M. If someone could help me with known ways to do this, or point me in the right direction that'd be helpful!
P.S. I think my graphics card is good enough for this, but could someone aid me in figuring out how long it might take to break this hash?