Idea: text-processor for pw-candidates - 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: Idea: text-processor for pw-candidates (/thread-9621.html) |
Idea: text-processor for pw-candidates - metall789 - 11-07-2020 Hi folks I'm kinda newbie but managed to recover some of my lost password of some zip-files with hascat and prince-processor, which was cool. I have some basic understanding of coding but too few experience (and actually no time) to code this idea myself, so I just want to share it with you. Probably someone has already done it but I couldn't find it the forum or at hascat-repos. So here it goes: Tool to derive password candidates/dictionary from input-texts. A common "algorithm" for obtaining random look-alike passwords which are good to remember by humans is to take the the first letter(s) of a memorizable sentence, poem, songtext or whatever "chain of words". As examples, lets take the following part of a song text: "Master of puppets I'm pulling your strings Twisting your mind and smashing your dreams" A possible password candidate would then be "MopIpysTymasyd", on which all the hascat rules for upper/lower case and other substitution could be applied as well. So I'm thinking of a tool with the following functionality:
E.g. a programm call then could look like:
-- as two chars from each word and max 7 words are processed, the -max-pw-length=16 will no be met, as the max-pw would be 2*7=14 -- with -max-chain-length=9, then -max-pw-length=16 would limit the output and make the chain length obsolete --- so guess only one max-parameter should be used at the programm call or the parameter that is first met dictates the other... and produce the following candidates, if the example above is in the <infile> Quote:# chain=1, char=2,1 It's somehow what could be produces with prince-processor too, but Prince normaly is fed with a list of unique words so it may take a long time until the same word is chained multiple times, and of course the chain from prince doesn't have the logic of the words-order as there is in sentence understand by humans. I'm not sure which iteration configuration would be more efficient, first process all chars for a given chain-length or vice versa. What do you think? Is there already such a tool out there? Cheers |