Splittable Pseudorandom Number Generators Using Cryptographic Hashing

3 views
Skip to first unread message

Isaac Dupree

unread,
Nov 6, 2013, 5:48:23 PM11/6/13
to lase...@googlegroups.com
A paper on how to write a splittable PRNG that doesn't have horrible
correlation between the splits. This may be something we'll want.

Paper:
http://publications.lib.chalmers.se/publication/183348-splittable-pseudorandom-number-generators-using-cryptographic-hashing

Its full text:
http://publications.lib.chalmers.se/records/fulltext/183348/local_183348.pdf

Haskell package implementing it:
http://hackage.haskell.org/package/tf-random
(although note "Please note that even though the generator provides very
high-quality pseudorandom numbers, it has not been designed with
cryptographic applications in mind.". The paper seems to think its
random numbers are cryptographically secure but doesn't seem to state
it. This combination can make sense since there have not been hordes of
people trying to break this algorithm regarding the properties a CSPRNG
should have[1].)

[1] https://en.wikipedia.org/wiki/CSPRNG#Requirements
Reply all
Reply to author
Forward
0 new messages