[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <BLU0-SMTP382C93A627EB777EEC300FBFD360@phx.gbl>
Date: Fri, 21 Dec 2012 11:17:58 +0100
From: Frank Dittrich <frank_dittrich@...mail.com>
To: john-users@...ts.openwall.com
Subject: Re: Creating Graphs from john.log
On 12/21/2012 12:00 AM, magnum wrote:
> --mkpc=1 Decreases max keys per crypt to 1, so you can see
> in log which exact rule caused a crack. This comes
> with a performance penalty.
BTW, how hard would it be to add an option which doesn't change MKPC for
the whole session, but remembers the current word and the current rule
(or current --incremental or --markov state at the begin of a new
MAX_KEYS_PER_CRYPT set of candidate passwords, and if after using this
set of candidates any hashes have been cracked, then just re-run this
particular set of MAX_KEYS_PER_CRYPT candidates with max keys per crypt = 1?
Then, the status output could show the correct number of password
candidates tried, and the log file could show the exact rule used in
word list or single mode.
If this can be done, the performance penalty for --mkpc=1 (plus a little
overhead for trying the same set of candidates twice) only applies if at
least 1 candidate among MAX_KEYS_PER_CRYPT candidates really cracked a
password.
Frank
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.
