hashcat Forum

Hey Guys,

statsprocessor v0.07 is ready!

It can fully replace Brute-Force since it covers the full keyspace

NOTICE -t 0 for BF


Generated candidates are guaranteed to be unique

NOTICE the sort -u


.. and here the chksum to prove its the same data


Statistically based on specific input (dictionary) -> Creates .hcstat file


This way you can optimize your attack by using your cracked list as input


Generator could be called AI since it applies statistics that are tricky and it actually prints out -real- words at the beginning

I think this is one of the strongest features. Havent seen anything similar before

Quote:root@sf:~# /root/statsprocessor-0.06/sp64.bin rockyou.hcstat ?l?l?l?l?l --pw-min 5 | head -30
marin
sarin
anger
chana
barin
jarin
lonan
tarin
darin
parin
karin
ronan
narin
garin
harin
elona
ilona
farin
warin
vinan
orina
yarin
zarin
unger
xxcke
qunan
minan
shana
alona
carin

Generator is still configurable due to the --threshold parameter

This way you can kick out guesses that are very unlikely to happen which reduces the keyspace, which makes the attack more fast


I have reduced to threshold to 22 (from 26) but saved nearly half of the full time to check it but just ignoring the 4 of them

Masks still can be used, but they act as filter-overlay - In case you dont want to miss the strength of Mask-Attack


Of course, adding a mask is not required. Its optional. It still works without. In case you omit the mask ?a?a?a?a?a... is used


Supports automatic increment with --pw-min and --pw-max


Restorable with -s


Limitable with -l

... and therefore distributable (to multiple computers)


GPGPU compatible, will be merged into oclHashcat-lite soon

I will port this version to oclHashcat-lite v0.10. It will replace Mask-Attack as its default attack-mode.

There will be the same -t parameter to have similar syntax.

--

Enough said, download it here: https://hashcat.net/files/statsprocessor-0.08.7z

--
atom

atom,

I don't pretend for a minute to fully understand what you have done. However I know it is awesome, very awesome and I am extremely grateful we have you, to not only come up with this stuff but to share it freely.

Thank you very much for your time, we all owe you a huge thanks.

atom;
Did my very first run of hcstat & statsprocessor, and I have my first question / feature request for you:
I'd like some way to actually see the per-position stats in readable text. I wonder if this could be visualized in some easy way?

My presentation from Passwords^11 (https://www.slideshare.net/perthorsheim/b...statistics), slide number 13, show per-position entropy - or simply number of unique characters per position. The pattern seem to repeat across multiple datasets, although they are all LM/NTLM sets from domains with enforced complexity rules.

My colleague @KluZz (Jan Fredrik Leversund) also made me some code to simply output a table showing number of occurences per character per position, as I've written about before.

--
A next evolution to this would of course be to either develop or grab existing code that gives us stats on 'which word usually comes after word x', where we analyze either passphrases or plain language from books etc, to enable cracking of long pass phrases. With/out using rules for adjusting to complexity and/or mangling rules, Re:https://securitynirvana.blogspot.no/2012/05/challenge-received.html (which remains uncracked. Unsalted MD5, length 16-24....)

are you looking for something like passpal? https://thepasswordproject.com/passpal

(07-02-2012, 02:17 PM)thorsheim Wrote: [ -> ]A next evolution to this would of course be to either develop or grab existing code that gives us stats on 'which word usually comes after word x', where we analyze either passphrases or plain language from books etc, to enable cracking of long pass phrases. With/out using rules for adjusting to complexity and/or mangling rules, Re:https://securitynirvana.blogspot.no/2012/05/challenge-received.html (which remains uncracked. Unsalted MD5, length 16-24....)

Hmm a markov-model for whole words? Sounds interessting but would require a bit a different concept. I am not sure yet how this could be done but I think with enough effort its possible, even on GPU. Maybe in a later version and thanks for the input!

(07-03-2012, 11:06 AM)atom Wrote: [ -> ]Hmm a markov-model for whole words? Sounds interessting but would require a bit a different concept. I am not sure yet how this could be done but I think with enough effort its possible, even on GPU. Maybe in a later version and thanks for the input!

Absolutely something different, yes. Then again; my Swiftkey software on my Android phone analyses my sms inbox and more, and then does both word prediction and 'next word' prediction based on the statistics it generates.

Unless you do correct horse battery staples passphrases, but something more logical - even as simple as standard sentences with correct grammar, this would eventually be very effective against natural language passphrases.

I'm not going to claim any original idea here, just going back to the xkcd 936 discussions, including this interesting blog post from @davienthemoose: https://secmoose.blogspot.no/2011/08/why-...-suck.html

hello, how can generate rokyou.hcstat for only numbers min 15 max 15

(08-18-2012, 11:12 PM)korsa741 Wrote: [ -> ]hello, how can generate rokyou.hcstat for only numbers min 15 max 15

Thats done through the command line options, --pw-min=15 --pw-max=15 Your not generating a file for a specific length, just statistic file for most likely occurrence, the file works for any length program is capable of generating.

thanks the mechanic