[Haskell-cafe] Password hashing

Martijn van Steenbergen martijn at van.steenbergen.nl
Thu Oct 30 08:43:36 EDT 2008

roger peppe wrote:
> if you're prepared to expend a few cpu cycles, you can always
> use something like the following "beating clocks" algorithm, which
> should generate
> at least some genuine randomness, as long as you've got preemptive
> scheduling, and a few hardware interrupts around the place.

I was taught that using the scheduler to generate randomness is a pretty 
bad idea, because randomness is actually a *very* strong property to 
demand from a stream of bits, and a scheduler doesn't offer any such 


More information about the Haskell-Cafe mailing list