Follow @Openwall on Twitter for new release announcements and other news
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date: Fri, 4 Nov 2016 15:48:42 +0100
From: matlink <>
Subject: Re: John does not fork as many times as I want

Le 04/11/2016 à 15:40, Solar Designer a écrit :
> On Fri, Nov 04, 2016 at 03:19:32PM +0100, matlink wrote:
>> Okay then there is less memory used when cracking hard password
>> (allowing using more forks) than when freshly starting to crack the
>> hashes?
> Sort of, but not exactly.  Rather, there's slower growth in combined
> memory needs (which increase through reduction of sharing) by the forked
> processes when the successful guesses are not as frequent.
>> Is that linked to the "1/3" I can see on the john status? Step
>> 3/3 requires less memory when forking than step 1/3?
> No, there's no direct relationship to that.  It's just a matter of
> getting the weakest passwords out first, at which point you restart and
> can run more processes due to them staying more similar to each other
> for longer.  If at some point they become dissimilar enough to run out
> of memory again, you can interrupt and restore that session (without
> losing any work already done).

Understood. I suppose that using "john --restore=mysession" is faster
than running again the above command having "--session=mysession", even
if that command specifies a potfile ?

> I also recommend the "--nolog --save-memory=1" options.  (Going higher
> than "1" for "--save-memory" will hurt performance, so don't do that.)
> Alexander

Matlink - Sysadmin
Sortez couverts, chiffrez vos mails : https://café-vie-privé
XMPP/Jabber :
Clé publique PGP : 0x186BB3CA
Empreinte Off-the-record : 572174BF 6983EA74 91417CA7 705ED899 DE9D05B2

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.