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: Sat, 8 Feb 2014 12:21:34 +0400
From: Solar Designer <>
Subject: Re: [PHC] multiply-hardening (Re: NoelKDF ready for submission)

On Sat, Feb 08, 2014 at 12:00:30PM +0400, Solar Designer wrote:
> As an option, you might want to reuse the operations and the constant
> used in Mersenne twister's initialization:
> #define NEXT_STATE(x, i) \
> 	(x) = 1812433253U * ((x) ^ ((x) >> 30)) + (i);
> where "x" is the current state (32-bit) and "i" is the iteration number.

There's a lot of additional info here:

including 64-bit and SIMD twisters (not just implementations of the
32-bit MT19937).

Also, see init_by_array() in:

This function uses different constants, and has an init_key[] input -
this might fit your needs better.


Powered by blists - more mailing lists