[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <4D47C9C8.705@banquise.net>
Date: Tue, 01 Feb 2011 09:52:24 +0100
From: Simon <simon@...quise.net>
To: john-users@...ts.openwall.com
Subject: Re: FreeBSD crypt() / MD5-crypt implementation question
On 31/01/2011 23:41, Freddie Witherden wrote:
> Interesting, as I've found it to perform quite a bit worse than BarsWF.
> In the MD5 code I've been poking about with (which is--essentially--the
> same as that in JtR) around ~4% can be gained from 0 input optimisation
> for inputs less than 224-bits. This is similar to what BarsWF does,
> although far less aggressive, given that MD5 crypt strings tend to be
> longer.
It is possible I had my measurements totally wrong. Barswf does the
"reverse the last rounds" optimization, but not my code, and my idea of
its performance is based on a computation of the per round efficiency.
Also it only works properly with ICC, but I'm sure this is obvious.
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.
