Word-generator based on per-position markov-chains
C Makefile
Switch branches/tags
Nothing to show
Latest commit cc37ab6 Mar 15, 2016 @jsteube jsteube Merge pull request #6 from unix-ninja/master
fix iteration of r_ctx loops
Permalink
Failed to load latest commit information.
src fix iteration of r_ctx loops Mar 1, 2016
.gitignore added .gitignore Jan 5, 2016
CHANGES Initial v0.12 commit Feb 9, 2015
LICENSE updated year in LICENSE file Jan 5, 2016
README.md Fix formating issues Feb 9, 2015
hashcat.hcstat Initial commit Feb 9, 2015

README.md

statsprocessor

Statsprocessor is a word-generator based on per-position markov-chains packed into a single stand-alone binary.

Example

The following example was made just to see what comes out of statsprocessor.


root@sf:~/statsprocessor-0.07# ./sp64.bin --pw-min 5 --pw-max 5 hashcat.hcstat ?l?l?l?l?l | head -9 
sange
songe
serin
singe
sunge
srane
shane
slane
snder

In markov-chains we have a statistic generated which letter is following which letter based on the analysis of the original input dictionary used to generate the .hcstat. In this case the most used letter on the first position is the letter is “s”. The program then looks up the markov-table with the key “s” to get the most used letter after the letter “s” on position 0. In our case, its the letter “a”. This “chain” goes till the ende of the word and iterates through all letters stored in the markov-table.

Compile

Simply run make

Binary distribution

Binaries for Linux, Windows and OSX: https://github.com/jsteube/statsprocessor/releases