brute force resume

[AcidRain]

The idea of doing a brute force resume isnt RLY that hard. It doesnt even have to be perfect. And i dont think any of us mind at all, to lose a few minutes or even hrs.
But just so the hashcat crew can think on this for a minute:
if you got 9 chars passwords, your attacking. using ?a
thats a total of 99 characters per place value.
99^9
aaaaaaaaa = very first occurance.
Aaaaaaaaa = i rly cant do the math, but i guess it would be close to (26^9)+2. im not very skilled with this. but i guess the last pass would be zzzzzzzzz and the next would be aaaaaaaaa, so skip that one, and go to Aaaaaaaaa

with this given, and someone who is far more mathematically inclined than i am, it SHOULD be very possible to come withing 0/-2hrs of computing time of where the last session was interrupted.

If for some sick twisted reason this is not possible, it should be very possible to just give the option to start at 10%, 20%, 30%, 40%, ...

[philsmd]

Sorry what are you talking about?

oclHashcat has support for restoring a cracking job, see:
https://hashcat.net/wiki/doku.php?id=ocl...me_support

BTW: cpu hashcat can also restore a task with the --skip command line argument

Therefore, I'm not sure what this post is all about

[atom]

We are using markov-chains as BF replacement in oclHashcat.



However, you can use -s parameter to skip to a specific percentage.