cryptonite-0.3: Cryptography Primitives sink

LicenseBSD-style
MaintainerVincent Hanquez <vincent@snarc.org>
Stabilitystable
Portabilitygood
Safe HaskellNone
LanguageHaskell2010

Crypto.Random

Contents

Description

 

Synopsis

Deterministic instances

data ChaChaDRG Source

ChaCha Deterministic Random Generator

Instances

Deterministic Random class

drgNew :: MonadRandom randomly => randomly ChaChaDRG Source

Create a new DRG from system entropy

drgNewTest :: (Word64, Word64, Word64, Word64, Word64) -> ChaChaDRG Source

Create a new DRG from 5 Word64.

This is a convenient interface to create deterministic interface for quickcheck style testing.

It can also be used in other contexts provided the input has been properly randomly generated.

withDRG :: DRG gen => gen -> MonadPseudoRandom gen a -> (a, gen) Source

Run a pure computation with a Deterministic Random Generator in the MonadPseudoRandom

withRandomBytes :: (ByteArray ba, DRG g) => g -> Int -> (ba -> a) -> (a, g) Source

Generate len random bytes and mapped the bytes to the function f.

This is equivalent to use Control.Arrow first with randomBytesGenerate

class DRG gen where Source

A Deterministic Random Generator (DRG) class

Methods

randomBytesGenerate :: ByteArray byteArray => Int -> gen -> (byteArray, gen) Source

Generate N bytes of randomness from a DRG

Instances

Random abstraction

class (Functor m, Monad m) => MonadRandom m where Source

A monad constraint that allows to generate random bytes

Methods

getRandomBytes :: ByteArray byteArray => Int -> m byteArray Source

Instances

data MonadPseudoRandom gen a Source

A simple Monad class very similar to a State Monad with the state being a DRG.

Instances