[−][src]Struct rand::prng::isaac64::Isaac64Rng
A random number generator that uses ISAAC-64, the 64-bit variant of the ISAAC algorithm.
ISAAC stands for "Indirection, Shift, Accumulate, Add, and Count" which are the principal bitwise operations employed. It is the most advanced of a series of array based random number generator designed by Robert Jenkins in 19961.
ISAAC-64 is mostly similar to ISAAC. Because it operates on 64-bit integers instead of 32-bit, it uses twice as much memory to hold its state and results. Also it uses different constants for shifts and indirect indexing, optimized to give good results for 64bit arithmetic.
ISAAC-64 is notably fast and produces excellent quality random numbers for non-cryptographic applications.
In spite of being designed with cryptographic security in mind, ISAAC hasn't
been stringently cryptanalyzed and thus cryptographers do not not
consensually trust it to be secure. When looking for a secure RNG, prefer
Hc128Rng
instead, which, like ISAAC, is an array-based RNG and one of
the stream-ciphers selected the by eSTREAM contest.
Overview of the ISAAC-64 algorithm:
(in pseudo-code)
Input: a, b, c, s[256] // state
Output: r[256] // results
mix(a,i) = !(a ^ a << 21) if i = 0 mod 4
a ^ a >> 5 if i = 1 mod 4
a ^ a << 12 if i = 2 mod 4
a ^ a >> 33 if i = 3 mod 4
c = c + 1
b = b + c
for i in 0..256 {
x = s_[i]
a = mix(a,i) + s[i+128 mod 256]
y = a + b + s[x>>3 mod 256]
s[i] = y
b = x + s[y>>11 mod 256]
r[i] = b
}
This implementation uses BlockRng64
to implement the RngCore
methods.
See for more information the documentation of IsaacRng
.
Bob Jenkins, ISAAC and RC4 ↩
Implementations
impl Isaac64Rng
[src]
pub fn new_unseeded() -> Self
[src]
use the FromEntropy or SeedableRng trait
Create a 64-bit ISAAC random number generator using the default fixed seed.
DEPRECATED. Isaac64Rng::new_from_u64(0)
will produce identical results.
pub fn new_from_u64(seed: u64) -> Self
[src]
use SeedableRng::seed_from_u64 instead
Create an ISAAC-64 random number generator using an u64
as seed.
If seed == 0
this will produce the same stream of random numbers as
the reference implementation when used unseeded.
Trait Implementations
impl Clone for Isaac64Rng
[src]
fn clone(&self) -> Isaac64Rng
[src]
fn clone_from(&mut self, source: &Self)
1.0.0[src]
impl Debug for Isaac64Rng
[src]
impl RngCore for Isaac64Rng
[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 Isaac64Rng
[src]
type Seed = <Isaac64Core 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 seed_from_u64(seed: u64) -> Self
[src]
Create an ISAAC random number generator using an u64
as seed.
If seed == 0
this will produce the same stream of random numbers as
the reference implementation when used unseeded.
fn from_rng<S: RngCore>(rng: S) -> Result<Self, Error>
[src]
Auto Trait Implementations
impl RefUnwindSafe for Isaac64Rng
impl Send for Isaac64Rng
impl Sync for Isaac64Rng
impl Unpin for Isaac64Rng
impl UnwindSafe for Isaac64Rng
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>,