|
Message-ID: <CACjvQXUboQ3r7nUZpkogrEHXnT=uFvFGHHaMmcxPpD5O3Y6HXQ@mail.gmail.com> Date: Wed, 8 May 2024 07:34:41 -0500 From: Adam Lininger <arlininger@...il.com> To: john-users@...ts.openwall.com Subject: Re: Markov phrases in john Take a look at https://github.com/travco/rephraser. It was made by a friend of mine and intended to use markov chains to generate word phrases. Adam On Wed, May 8, 2024 at 5:34 AM Albert Veli <albert.veli@...il.com> wrote: > Hi, as many of you know a mask will not try combinations of characters > in alphabetical order but rather in the most likely to least likely order > using something like Markov chains: > > ./john --stdout --mask='?l?l' > aa > ea > ia > oa > na > ra > la > sa > ... > > > This is useful to find human-created passwords early. Nowadays it is more > and more popular to use combinations of words to create passwords. Would > it be possible to use Markov or similar to traverse entire words from a > wordlist and use the most common pair of adjacent words from the list > first, then the second most common and so on? > > Like Markov does for individual characters, but on entire words instead? > I hope you understand what I mean. Then maybe extend this to three > words. It is possible with the '?l?l?l' mask so in some way it should be > possible to do for entire words too. Ideally there would be an option to > specify word delimiter too. Maybe even an option to provide a corpus text > to train the chains on. Then an option to specify how many words to > include in the guesses, the top 100 words, the top 500 words or the top > 2000 words and so on. For two word combinations you can use a larger > number and for three or four words, smaller numbers. > > What do you think? Would this be useful, or is it possible now already? > > > Regards, > > Albert >
Powered by blists - more mailing lists
Confused about mailing lists and their use? Read about mailing lists on Wikipedia and check out these guidelines on proper formatting of your messages.