Trying to crack a single 15-length NTLM hash. I know the following:
1 - special
1 - upper
13 - lower
no - digits
consists of 6 words (no spaces)
it's a phrase
Assume cracking rig has 2 GTX1080.
My first thought was to take the google-top-10000 list of short words located here (which is actually ONLY 2184 words)
And running that through combinator3:
Then after that's done, I could do something like this:
I'm guessing this is going to be quite slow.
Or maybe I could do something like this:
Thoughts? Other ideas? Looking for a way to utilize GPU as much as possible (I'm sure this goes without saying 😉). Any help is appreciated.
1 - special
1 - upper
13 - lower
no - digits
consists of 6 words (no spaces)
it's a phrase
Assume cracking rig has 2 GTX1080.
My first thought was to take the google-top-10000 list of short words located here (which is actually ONLY 2184 words)
Code:
https://github.com/first20hours/google-10000-english/blob/master/google-10000-english-usa-no-swears-short.txtAnd running that through combinator3:
Code:
combinator3.bin google-short google-short google-short > google-3times-shortThen after that's done, I could do something like this:
Code:
combinator.bin google-3times-short google-3times-short | len.bin 14 15 | hashcat -m1000 -O -w4 -a0 hash.txt -r .rules/best64I'm guessing this is going to be quite slow.
Or maybe I could do something like this:
Code:
hashcat -m1000 -O -w4 -a1 hash.txt google-3times-short google-3times-short and somehow use -j or -k rules to capitalize the first character and add a special at endThoughts? Other ideas? Looking for a way to utilize GPU as much as possible (I'm sure this goes without saying 😉). Any help is appreciated.