Codec.Encryption.BurtonRNGSlow
Description
This module includes two all-haskell implementations of Burton Smith's algorithm for a statistically-sound binary tree of random number generators. See the following thread:
http://www.mail-archive.com/haskell-cafe@haskell.org/msg83901.html
Generally, Codec.Crypto.IntelAES should be used in favor of this module, but it is included for benchmarking purposes.
- mkBurtonGen_reference :: Word128 -> RNG_ref
- mkBurtonGen :: Word128 -> RNG
Documentation
mkBurtonGen_reference :: Word128 -> RNG_ref
Extra slow reference implementation.
mkBurtonGen :: Word128 -> RNG
The idea with this one is that once we generate 128 bits of randomness we parcel it out into two or four ints.