lists  /  announce  owl-users  owl-dev  john-users  john-dev  passwdqc-users  yescrypt  popa3d-users  /  oss-security  kernel-hardening  musl  sabotage  tlsify  passwords  /  crypt-dev  xvendor  /  Bugtraq  Full-Disclosure  linux-kernel  linux-netdev  linux-ext4  linux-hardening  PHC 
Open Source and information security mailing list archives
Hash Suite for Android: free password hash cracker in your pocket
[<prev] [next>] [<thread-prev] [thread-next>] [day] [month] [year] [list]
Date: Thu, 13 Feb 2014 10:07:32 -0500
From: Bill Cox <>
Subject: Re: [PHC] multiply-hardening (Re: NoelKDF ready for submission)

On Thu, Feb 13, 2014 at 9:44 AM, Bill Cox <> wrote:
>> I'll go ahead and do 1,000,000 runs with this and test the last
> 64-bits for collisions (no 64-bit collisions should occur, and there
> should be around 100-130 collisions in the lower 32-bits and in the
> upper 32-bits).  I think this has will pass this test.  I'll post the
> results when I have them.  It looks like my NoelKDF hash function may
> not survive the day...
> Bill

The 1,000,000 value test passed.  There were no 64-bit collisions in
the last 64-bits of memory from 1,000,000 runs where I generated 1MB
of data with a block size of 64.  There were 121 collisions in the low
32-bits, and 117 in the upper, right in the middle of the probable


Powered by blists - more mailing lists