[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <CANWtx00+RJUy0Y7kXnEq8feEU8wTJ5Mi+h82kRK4RPN__NqOzQ@mail.gmail.com>
Date: Thu, 19 Apr 2012 07:31:21 -0400
From: Rich Rumble <richrumble@...il.com>
To: john-users@...ts.openwall.com
Subject: Re: automation equipped working place of hash cracker, proposal
On Thu, Apr 19, 2012 at 6:53 AM, Aleksey Cherepanov
<aleksey.4erepanov@...il.com> wrote:
> I think the most effective compression for candidates is to make john.ocnf,
> john.rec and some kind of value for amount to stop after. So we run john
> --stdout on the server, write down all information we need to produce
> appropriate .rec files and then distribute files to the nodes. Or even without
> --stdout: we just produce needed .rec files. I do not know what is exactly
> stored in .rec file so I do not know how easy what I say about is. But it
> seems to be real, does not it?
That is "sort of" what the MPI patch does, here is a thread where we
discussed basically what Aleksey suggests:
http://www.openwall.com/lists/john-users/2011/06/29/3
-rich
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.
