[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <CAJ9ii1HVuMh95YtfqCUMfQ2umKOHgq-9wNkdPUVS7=RyW+v5vA@mail.gmail.com>
Date: Mon, 5 Jan 2015 13:21:34 -0500
From: Matt Weir <cweir@...edu>
To: "john-users@...ts.openwall.com" <john-users@...ts.openwall.com>
Subject: Re: PRINCE approach from hashcat
I ran some tests with PRINCE and posted the results here:
http://reusablesec.blogspot.com/2014/12/tool-deep-dive-prince.html. I need
to model a longer cracking session but I was pleasantly surprised with how
well it did.
Matt
On Wed, Dec 10, 2014 at 3:14 PM, magnum <john.magnum@...hmail.com> wrote:
> On 2014-12-10 20:53, Rich Rumble wrote:
>
>> Can incremental be expanded to (smallish)words that are commonly next
>> to one another? You'd need a good dataset of real multi-word
>> passwords, the trouble may be that the passwords are not delimited
>> into words by spaces or other characters.
>>
>
> I think Bartavelle has mentioned doing that with Markov mode. It's
> conceptually simple but may be harder in practice.
>
> magnum
>
>
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.
