[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <CABob6ircfKCzPvarTYa=E6bLSS01F8D-ShVaf5PwD3H_x5VsHw@mail.gmail.com>
Date: Tue, 10 Dec 2013 01:00:37 +0100
From: Lukas Odzioba <lukas.odzioba@...il.com>
To: john-dev@...ts.openwall.com
Subject: Re: md5crypt-opencl
2013/12/10 magnum <john.magnum@...hmail.com>:
> Great. Would it be too much work for you to post a complete patch (assuming
> it seems stable) with your current code first, for committing? I'd like a
> few milestones rather than a giant untracked leap.
No problem, tomorrow I'll retest the code and post a patch.
> Eventually we should come up with an idea how to best (quick, simple, safe)
> sort candidates per length. This would be a very good boost for rar-opencl
> too but I have yet to come up with an idea simple enough to be interesting.
> I really want it simple and beautyful or I'll leave it alone.
What about counting/bucket sort with logic inside set_key/crypt_all.
It should be dead simple with mostly 1 memcpy overhead. This way we
can easily "compress" candidates too.
Lukas
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.
