![]() |
statsprocessor v0.03 - Printable Version +- hashcat Forum (https://hashcat.net/forum) +-- Forum: Support (https://hashcat.net/forum/forum-3.html) +--- Forum: hashcat-utils, maskprocessor, statsprocessor, md5stress, wikistrip (https://hashcat.net/forum/forum-28.html) +--- Thread: statsprocessor v0.03 (/thread-1265.html) Pages:
1
2
|
statsprocessor v0.03 - atom - 06-10-2012 THIS THREAD IS OUTDATED, PLS CONTINUE HERE: https://hashcat.net/forum/thread-1285.html I'm very proud to present you a new toy: statsprocessor Download here: http://hashcat.net/files/statsprocessor-0.04.7z This is a standalone word-generator like the maskprocessor, but based on markov-attack! The markov-attack is a statistically based brute-force like attack, but instead of specifying a charset or a mask, we specify a file. This file is once generated by ourself in a previous step. It contains statistical informations which are made out an automated analysis of a given dictionary. To do the analysis we use another new tool called "hcstatgen" which is part of the new hashcat-utils package, starting with version 0.6. Download 32 bit here: http://hashcat.net/files/hashcat-utils-0.7-32.7z Download 64 bit here: http://hashcat.net/files/hashcat-utils-0.7-64.7z The second program, the new tool "statprocessor", generates the words based on the statistical order of the .hcstat file. NOTE: In Brute-Force Attack or in Mask Attack we can limit the keyspace by setting a smaller charset in order to reduce the attack-time. In Markov Attack we have something similar, the "threshold". All you do is to specify a number. The higher the number, the higher the threshold to add a new link between two characters on the two-level table on which the markov-attack bases on. This background is not so important, just remember that the higher the value, the smaller the keyspace and thus the faster the attack. If you set the threshold to 0 its like a real Brute-Force attack but with markov ordering. Here is a example usage: Generate the .hcstat out of the rockyou.txt dictionary Code: root@sf:~/statsprocessor-0.01# /root/hashcat-utils-0.6/hcstatgen.bin rockyou.hcstat < /root/dict/untouched/rockyou.txt NOTE: I will add rockyou.hcstat as an example to the distribution so that new users have something to instantly play with. Now lets run the statprocessor just to see what comes out. I will set an totally oversized threshold which is not for concrete usage but this way the output is so small that you will get an idea of how it looks like Code: root@sf:~/statsprocessor-0.01# ./sp64.bin --pw-min 5 --pw-max 5 --threshold 400000 rockyou.hcstat | head -20 I will explain a bit in detail next. This if for those who want to know how markov-attack works internally. Otherwise you can skip to the next command. As you can see, it starts with the char "a". That is because "a" is the most used char in rockyou.txt. The first character is what we call the root-character. All the following char are looked up from the markov-table. The table is an 1-to-n table. The key can be any char. For this char, the table holds an ORDERED array structure which char follows next. From what we see here is that the char "n" is the most followed char after the char "a". Because of some statistical accident the char "a" is followed most by the char "n", so it ends up in a loop. In the next iteration, the 2nd most followed char after "n" is the "e", and so on. As you can see after the word "anasa" there is a four char word "anat" following, even though we specified --pw-min 5. This happend because of the high threshold. There is simply no char following the "t" char more than 400000 times in rockyou.txt. Since we always focus on performance, see how fast this beast is Code: root@sf:~/statsprocessor-0.01# ./sp64.bin --pw-min 5 --pw-max 5 rockyou.hcstat | wc -l This makes it 89.6 Mplains/s fast - on a single cpu core! This 89.6 Mplains/s is fast enough to feed oclHashcat-plus for slow algorithms like DCC2 or WPA/WPA2. Here is an example run Code: root@sf:~/oclHashcat-plus-0.09# /root/statsprocessor-0.01/sp64.bin --pw-min 8 /root/statsprocessor-0.01/rockyou.hcstat | ./oclHashcat-plus64.bin -m 2500 test.hccap -n 80 As you can see, this is full speed for my hd6990. But what if we want to use this with fast algorithms like MD5/SHA1? Well that would require a special new attack-mode for oclHashcat-lite or oclHashcat-plus. I will defenitly add this to a later version. Till that you can workaround this just by adding some workload to each generated word Code: $ /root/statsprocessor-0.01/sp64.bin --pw-min 6 /root/statsprocessor-0.01/rockyou.hcstat | ./oclHashcat-plus64.bin -n 80 example0.hash -r rules/hybrid/prepend_ld.rule -r rules/hybrid/prepend_ld.rule Well you got the idea... NOTE
RE: statsprocessor v0.01 - M@LIK - 06-10-2012 I didn't understand everything xD But this looks very interesting! Good job atom! RE: statsprocessor v0.01 - Hash-IT - 06-10-2012 Wow.. M@LIK might not have understood everything but I didn't understand anything ! ![]() However it looks great !! Thank you very much atom ! RE: statsprocessor v0.01 - Pixel - 06-10-2012 Great! more tools to play with thanks atom RE: statsprocessor v0.01 - rurapenthe - 06-10-2012 Very nice Atom! :-) I'm playing with it already... gonna be fun. RE: statsprocessor v0.01 - .::Rizwan::. - 06-10-2012 All thing flies by over my head : lol Very Nice Atom,A very handy tool indeed RE: statsprocessor v0.02 - atom - 06-10-2012 In the meanwhile I've finished v0.02. This one accepts an optional typical hashcat mask. Download it here: http://hashcat.net/files/statsprocessor-0.02.7z This can be used as a filter. It is best explained with two examples: Without filter-mask (as in v0.01) Code: root@sf:~/statsprocessor-0.02# ./sp64.bin --pw-min 3 rockyou.hcstat | head -10 With new filter-mask Code: root@sf:~/statsprocessor-0.02# ./sp64.bin --pw-min 3 rockyou.hcstat ?l?l?d | head -10 RE: statsprocessor v0.02 - Hash-IT - 06-11-2012 Steady on atom !!! I've not learned how to use the first one properly yet !!! ![]() RE: statsprocessor v0.02 - ntk - 06-11-2012 awsome. thanks RE: statsprocessor v0.03 - atom - 06-13-2012 Changes:
|