• Stars
    star
    168
  • Rank 225,507 (Top 5 %)
  • Language
    C
  • License
    MIT License
  • Created almost 10 years ago
  • Updated about 1 year ago

Reviews

There are no reviews yet. Be the first to send feedback to the community and the maintainers!

Repository Details

Word-generator based on per-position markov-chains

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