Expand description
Deterministic implementations of ring::rand::SecureRandom.
These implementations are particularly useful for testing implementations of randomized algorithms & protocols using known-answer-tests where the test vectors contain the random seed to use. They are also especially useful for some types of fuzzing.
Structs
An implementation of SecureRandom that always fills the output slice
with the given byte.
An implementation of SecureRandom that always fills the output slice
with the slice in bytes. The length of the slice given to slice
must match exactly.
An implementation of SecureRandom where each slice in bytes is a
test vector for one call to fill(). Not thread-safe.