[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Message-ID: <CAOLP8p7sP1npzXfV7JnRQDvigLrk85DMXDVPX3SEyS3V8F9y0Q@mail.gmail.com>
Date: Fri, 3 Jan 2014 17:26:48 -0500
From: Bill Cox <waywardgeek@...il.com>
To: discussions@...sword-hashing.net
Subject: Re: Reworked KDF available on github for feedback: NOELKDF
The hashed memory from NOELKDF passed the dieharder tests! Given how dumb
the hash is, I'm floored. A very simple routine can be written that will
identify this as non-random output after 32KB with 100% accuracy. It was
never meant to be very random, but I guess I can now say that it least
*looks* pretty random. This may mean I should simplify the hash even more,
but there's not much room left for speed-up. KDFs in this competition,
IMO, should not waste cycles trying to produce high entropy hash data, but
it's a nice bonus.
On Fri, Jan 3, 2014 at 3:12 PM, Bill Cox <waywardgeek@...il.com> wrote:
> I gave it a name this time. It's based on the experience so far from
> keystretch, but is simpler, and even faster. It doesn't use a "key" to
> hash pages, but instead treats the previously generated "page" as the key
> for generating the next one by hashing it with a random previous page. On
> my Corei7 server, it runs about 15% slower than memmove (which is faster
> than memcpy because 1/2 the memory is allocated). 2GB of hashing takes
> 0.35 seconds. Both are multi-threaded 2-way, which is the fastest case on
> both machines.
>
> The code is at:
>
> https://github.com/waywardgeek/noelkdf
>
> The name for NOELKDF comes from one of (I'm not saying which):
>
> a) A contrived acronym of "Numerical Order Encryption Ladder" somehow
> related to the ladder of hashed pages.
> b) The name of my cat :-)
>
> Bill
>
Content of type "text/html" skipped
Powered by blists - more mailing lists