[−][src]Struct rand::prng::chacha::ChaChaRng
A cryptographically secure random number generator that uses the ChaCha algorithm.
ChaCha is a stream cipher designed by Daniel J. Bernstein 1, that we use as an RNG. It is an improved variant of the Salsa20 cipher family, which was selected as one of the "stream ciphers suitable for widespread adoption" by eSTREAM 2.
ChaCha uses add-rotate-xor (ARX) operations as its basis. These are safe against timing attacks, although that is mostly a concern for ciphers and not for RNGs. Also it is very suitable for SIMD implementation. Here we do not provide a SIMD implementation yet, except for what is provided by auto-vectorisation.
With the ChaCha algorithm it is possible to choose the number of rounds the core algorithm should run. The number of rounds is a tradeoff between performance and security, where 8 rounds is the minimum potentially secure configuration, and 20 rounds is widely used as a conservative choice. We use 20 rounds in this implementation, but hope to allow type-level configuration in the future.
We use a 64-bit counter and 64-bit stream identifier as in Benstein's
implementation 1 except that we use a stream identifier in place of a
nonce. A 64-bit counter over 64-byte (16 word) blocks allows 1 ZiB of output
before cycling, and the stream identifier allows 264 unique
streams of output per seed. Both counter and stream are initialized to zero
but may be set via set_word_pos
and set_stream
.
The word layout is:
constant constant constant constant
seed seed seed seed
seed seed seed seed
counter counter nonce nonce
This implementation uses an output buffer of sixteen u32
words, and uses
BlockRng
to implement the RngCore
methods.
D. J. Bernstein, ChaCha, a variant of Salsa20 ↩
Implementations
impl ChaChaRng
[src]
pub fn new_unseeded() -> ChaChaRng
[src]
use the FromEntropy or SeedableRng trait
Create an ChaCha random number generator using the default fixed key of 8 zero words.
Examples
use rand::{RngCore, ChaChaRng}; let mut ra = ChaChaRng::new_unseeded(); println!("{:?}", ra.next_u32()); println!("{:?}", ra.next_u32());
Since this equivalent to a RNG with a fixed seed, repeated executions of an unseeded RNG will produce the same result. This code sample will consistently produce:
- 2917185654
- 2419978656
pub fn set_stream(&mut self, stream: u64)
[src]
Set the stream number.
This is initialized to zero; 264 unique streams of output are available per seed/key.
Note that in order to reproduce ChaCha output with a specific 64-bit
nonce, one can convert that nonce to a u64
in little-endian fashion
and pass to this function. In theory a 96-bit nonce can be used by
passing the last 64-bits to this function and using the first 32-bits as
the most significant half of the 64-bit counter (which may be set
indirectly via set_word_pos
), but this is not directly supported.
Trait Implementations
impl Clone for ChaChaRng
[src]
impl CryptoRng for ChaChaRng
[src]
impl Debug for ChaChaRng
[src]
impl From<ChaChaCore> for ChaChaRng
[src]
fn from(core: ChaChaCore) -> Self
[src]
impl RngCore for ChaChaRng
[src]
fn next_u32(&mut self) -> u32
[src]
fn next_u64(&mut self) -> u64
[src]
fn fill_bytes(&mut self, dest: &mut [u8])
[src]
fn try_fill_bytes(&mut self, dest: &mut [u8]) -> Result<(), Error>
[src]
impl SeedableRng for ChaChaRng
[src]
type Seed = <ChaChaCore as SeedableRng>::Seed
Seed type, which is restricted to types mutably-dereferencable as u8
arrays (we recommend [u8; N]
for some N
). Read more
fn from_seed(seed: Self::Seed) -> Self
[src]
fn from_rng<R: RngCore>(rng: R) -> Result<Self, Error>
[src]
fn seed_from_u64(state: u64) -> Self
[src]
Auto Trait Implementations
impl RefUnwindSafe for ChaChaRng
impl Send for ChaChaRng
impl Sync for ChaChaRng
impl Unpin for ChaChaRng
impl UnwindSafe for ChaChaRng
Blanket Implementations
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> Borrow<T> for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<R> FromEntropy for R where
R: SeedableRng,
[src]
R: SeedableRng,
fn from_entropy() -> R
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<R> Rng for R where
R: RngCore + ?Sized,
[src]
R: RngCore + ?Sized,
fn gen<T>(&mut self) -> T where
Standard: Distribution<T>,
[src]
Standard: Distribution<T>,
fn gen_range<T: PartialOrd + SampleUniform>(&mut self, low: T, high: T) -> T
[src]
fn sample<T, D: Distribution<T>>(&mut self, distr: D) -> T
[src]
fn sample_iter<'a, T, D: Distribution<T>>(
&'a mut self,
distr: &'a D
) -> DistIter<'a, D, Self, T>ⓘ where
Self: Sized,
[src]
&'a mut self,
distr: &'a D
) -> DistIter<'a, D, Self, T>ⓘ where
Self: Sized,
fn fill<T: AsByteSliceMut + ?Sized>(&mut self, dest: &mut T)
[src]
fn try_fill<T: AsByteSliceMut + ?Sized>(
&mut self,
dest: &mut T
) -> Result<(), Error>
[src]
&mut self,
dest: &mut T
) -> Result<(), Error>
fn gen_bool(&mut self, p: f64) -> bool
[src]
fn choose<'a, T>(&mut self, values: &'a [T]) -> Option<&'a T>
[src]
fn choose_mut<'a, T>(&mut self, values: &'a mut [T]) -> Option<&'a mut T>
[src]
fn shuffle<T>(&mut self, values: &mut [T])
[src]
fn gen_iter<T>(&mut self) -> Generator<T, &mut Self>ⓘ where
Standard: Distribution<T>,
[src]
Standard: Distribution<T>,
fn gen_weighted_bool(&mut self, n: u32) -> bool
[src]
fn gen_ascii_chars(&mut self) -> AsciiGenerator<&mut Self>ⓘImportant traits for AsciiGenerator<R>
impl<R: RngCore> Iterator for AsciiGenerator<R> type Item = char;
[src]
Important traits for AsciiGenerator<R>
impl<R: RngCore> Iterator for AsciiGenerator<R> type Item = char;
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
fn to_owned(&self) -> T
[src]
fn clone_into(&self, target: &mut T)
[src]
impl<T, U> TryFrom<U> for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T, U> TryInto<U> for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,