https://github.com/hashcat/statsprocessor

Word-generator based on per-position markov-chains
https://github.com/hashcat/statsprocessor

Last synced: 2 days ago
JSON representation

Word-generator based on per-position markov-chains

• Host: GitHub
• URL: https://github.com/hashcat/statsprocessor
• Owner: hashcat
• License: mit
• Created: 2015-02-09T15:05:52.000Z (almost 10 years ago)
• Default Branch: master
• Last Pushed: 2023-10-27T12:27:04.000Z (about 1 year ago)
• Last Synced: 2024-05-21T13:49:51.857Z (8 months ago)
• Language: C
• Homepage:
• Size: 572 KB
• Stars: 167
• Watchers: 29
• Forks: 60
• Open Issues: 1
• Metadata Files:
  • Readme: README.md
  • Changelog: CHANGES
  • License: LICENSE

Awesome Lists containing this project

• awesome-password-cracking - statsprocessor - Word generator based on per-position markov-chains. (Wordlist tools / Generation/Manipulation)

README

        
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