|
Message-ID: <CAEo4CeP4cQPpCkcppBXcWqJauTmRHXm-4oniQ-Lphh23JPw3gA@mail.gmail.com> Date: Tue, 21 Jul 2020 23:15:22 +0200 From: Albert Veli <albert.veli@...il.com> To: john-users@...ts.openwall.com Subject: Re: Known part of password, attempting incremental attack On Tue, Jul 21, 2020 at 8:25 PM Alexander Hunt <alexhunt308@...il.com> wrote: > He knows the first 5 characters and the last 2 char. for sure. He believes > there is one word (possibly two) > between the first 5 and the last 2. He believes it is a dictionary word so > I started with a Wordlist attack with a dictionary list I pulled off the > internet, and the parameters he set. That didnt work so I would like to set > up a incremental attack to determine the 5-10 characters in between the > characters he knows. Is this possible? > Sure, but 10 characters will take extremely long time. If the first characters are "abcde" and the last two "yz" you could run like: john ... -mask:abcde?a?a?a?a?ayz to try all combinations of 5 upper, lower, digits and special characters. See the documentation for more options. https://github.com/magnumripper/JohnTheRipper/blob/bleeding-jumbo/doc/MASK When that attack is done you could run with 6 characters and so on. To run with a wordlist use ?w to insert all words from the wordlist, one at a time. But I would create a big wordlist of all combinations of two words and use that as input to john and use ?w in the mask. That will be much faster than trying to brute force all combinations of up to 10 characters.
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.