Struct solana_evm_loader_program::scope::evm::secp256k1::rand::rngs::JitterRng [−][src]
A true random number generator based on jitter in the CPU execution time, and jitter in memory access time.
This is a true random number generator, as opposed to pseudo-random
generators. Random numbers generated by JitterRng
can be seen as fresh
entropy. A consequence is that is orders of magnitude slower than OsRng
and PRNGs (about 103..106 slower).
There are very few situations where using this RNG is appropriate. Only very few applications require true entropy. A normal PRNG can be statistically indistinguishable, and a cryptographic PRNG should also be as impossible to predict.
Use of JitterRng
is recommended for initializing cryptographic PRNGs when
OsRng
is not available.
JitterRng
can be used without the standard library, but not conveniently,
you must provide a high-precision timer and carefully have to follow the
instructions of new_with_timer
.
This implementation is based on Jitterentropy version 2.1.0.
Note: There is no accurate timer available on Wasm platforms, to help
prevent fingerprinting or timing side-channel attacks. Therefore
JitterRng::new()
is not available on Wasm.
Quality testing
JitterRng::new()
has build-in, but limited, quality testing, however
before using JitterRng
on untested hardware, or after changes that could
effect how the code is optimized (such as a new LLVM version), it is
recommend to run the much more stringent
NIST SP 800-90B Entropy Estimation Suite.
Use the following code using timer_stats
to collect the data:
use rand::rngs::JitterRng; let mut rng = JitterRng::new()?; // 1_000_000 results are required for the // NIST SP 800-90B Entropy Estimation Suite const ROUNDS: usize = 1_000_000; let mut deltas_variable: Vec<u8> = Vec::with_capacity(ROUNDS); let mut deltas_minimal: Vec<u8> = Vec::with_capacity(ROUNDS); for _ in 0..ROUNDS { deltas_variable.push(rng.timer_stats(true) as u8); deltas_minimal.push(rng.timer_stats(false) as u8); } // Write out after the statistics collection loop, to not disturb the // test results. File::create("jitter_rng_var.bin")?.write(&deltas_variable)?; File::create("jitter_rng_min.bin")?.write(&deltas_minimal)?;
This will produce two files: jitter_rng_var.bin
and jitter_rng_min.bin
.
Run the Entropy Estimation Suite in three configurations, as outlined below.
Every run has two steps. One step to produce an estimation, another to
validate the estimation.
- Estimate the expected amount of entropy that is at least available with
each round of the entropy collector. This number should be greater than
the amount estimated with
64 / test_timer()
.python noniid_main.py -v jitter_rng_var.bin 8 restart.py -v jitter_rng_var.bin 8 <min-entropy>
- Estimate the expected amount of entropy that is available in the last 4
bits of the timer delta after running noice sources. Note that a value of
3.70
is the minimum estimated entropy for true randomness.python noniid_main.py -v -u 4 jitter_rng_var.bin 4 restart.py -v -u 4 jitter_rng_var.bin 4 <min-entropy>
- Estimate the expected amount of entropy that is available to the entropy
collector if both noice sources only run their minimal number of times.
This measures the absolute worst-case, and gives a lower bound for the
available entropy.
python noniid_main.py -v -u 4 jitter_rng_min.bin 4 restart.py -v -u 4 jitter_rng_min.bin 4 <min-entropy>
Implementations
impl JitterRng
[src]
pub fn new() -> Result<JitterRng, TimerError>
[src]
Create a new JitterRng
. Makes use of std::time
for a timer, or a
platform-specific function with higher accuracy if necessary and
available.
During initialization CPU execution timing jitter is measured a few hundred times. If this does not pass basic quality tests, an error is returned. The test result is cached to make subsequent calls faster.
pub fn new_with_timer(timer: fn() -> u64) -> JitterRng
[src]
Create a new JitterRng
.
A custom timer can be supplied, making it possible to use JitterRng
in
no_std
environments.
The timer must have nanosecond precision.
This method is more low-level than new()
. It is the responsibility of
the caller to run test_timer
before using any numbers generated with
JitterRng
, and optionally call set_rounds
. Also it is important to
consume at least one u64
before using the first result to initialize
the entropy collection pool.
Example
use rand::rngs::JitterRng; fn get_nstime() -> u64 { use std::time::{SystemTime, UNIX_EPOCH}; let dur = SystemTime::now().duration_since(UNIX_EPOCH).unwrap(); // The correct way to calculate the current time is // `dur.as_secs() * 1_000_000_000 + dur.subsec_nanos() as u64` // But this is faster, and the difference in terms of entropy is // negligible (log2(10^9) == 29.9). dur.as_secs() << 30 | dur.subsec_nanos() as u64 } let mut rng = JitterRng::new_with_timer(get_nstime); let rounds = rng.test_timer()?; rng.set_rounds(rounds); // optional let _ = rng.gen::<u64>(); // Ready for use let v: u64 = rng.gen();
pub fn set_rounds(&mut self, rounds: u8)
[src]
Configures how many rounds are used to generate each 64-bit value. This must be greater than zero, and has a big impact on performance and output quality.
new_with_timer
conservatively uses 64 rounds, but often less rounds
can be used. The test_timer()
function returns the minimum number of
rounds required for full strength (platform dependent), so one may use
rng.set_rounds(rng.test_timer()?);
or cache the value.
pub fn test_timer(&mut self) -> Result<u8, TimerError>
[src]
Basic quality tests on the timer, by measuring CPU timing jitter a few hundred times.
If succesful, this will return the estimated number of rounds necessary
to collect 64 bits of entropy. Otherwise a TimerError
with the cause
of the failure will be returned.
pub fn timer_stats(&mut self, var_rounds: bool) -> i64
[src]
Statistical test: return the timer delta of one normal run of the
JitterRng
entropy collector.
Setting var_rounds
to true
will execute the memory access and the
CPU jitter noice sources a variable amount of times (just like a real
JitterRng
round).
Setting var_rounds
to false
will execute the noice sources the
minimal number of times. This can be used to measure the minimum amount
of entropy one round of the entropy collector can collect in the worst
case.
See Quality testing on how to
use timer_stats
to test the quality of JitterRng
.
Trait Implementations
impl Clone for JitterRng
[src]
impl CryptoRng for JitterRng
[src]
impl Debug for JitterRng
[src]
impl RngCore for JitterRng
[src]
Auto Trait Implementations
impl RefUnwindSafe for JitterRng
impl Send for JitterRng
impl Sync for JitterRng
impl Unpin for JitterRng
impl UnwindSafe for JitterRng
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,
pub fn borrow_mut(&mut self) -> &mut T
[src]
impl<T> From<T> for T
[src]
impl<T, U> Into<U> for T where
U: From<T>,
[src]
U: From<T>,
impl<T> MaybeDebug for T where
T: Debug,
[src]
T: Debug,
impl<R> Rng for R where
R: RngCore + ?Sized,
[src]
R: RngCore + ?Sized,
pub fn gen<T>(&mut self) -> T where
Standard: Distribution<T>,
[src]
Standard: Distribution<T>,
pub fn gen_range<T, B1, B2>(&mut self, low: B1, high: B2) -> T where
T: SampleUniform,
B1: SampleBorrow<T>,
B2: SampleBorrow<T>,
[src]
T: SampleUniform,
B1: SampleBorrow<T>,
B2: SampleBorrow<T>,
pub fn sample<T, D>(&mut self, distr: D) -> T where
D: Distribution<T>,
[src]
D: Distribution<T>,
pub fn sample_iter<T, D>(&'a mut self, distr: &'a D) -> DistIter<'a, D, Self, T>ⓘ where
D: Distribution<T>,
[src]
D: Distribution<T>,
pub fn fill<T>(&mut self, dest: &mut T) where
T: AsByteSliceMut + ?Sized,
[src]
T: AsByteSliceMut + ?Sized,
pub fn try_fill<T>(&mut self, dest: &mut T) -> Result<(), Error> where
T: AsByteSliceMut + ?Sized,
[src]
T: AsByteSliceMut + ?Sized,
pub fn gen_bool(&mut self, p: f64) -> bool
[src]
pub fn gen_ratio(&mut self, numerator: u32, denominator: u32) -> bool
[src]
pub fn choose<T>(&mut self, values: &'a [T]) -> Option<&'a T>
[src]
pub fn choose_mut<T>(&mut self, values: &'a mut [T]) -> Option<&'a mut T>
[src]
pub fn shuffle<T>(&mut self, values: &mut [T])
[src]
impl<T> Same<T> for T
[src]
type Output = T
Should always be Self
impl<T> ToOwned for T where
T: Clone,
[src]
T: Clone,
type Owned = T
The resulting type after obtaining ownership.
pub fn to_owned(&self) -> T
[src]
pub 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.
pub 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>,
type Error = <U as TryFrom<T>>::Error
The type returned in the event of a conversion error.
pub fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>
[src]
impl<T> Typeable for T where
T: Any,
T: Any,
impl<V, T> VZip<V> for T where
V: MultiLane<T>,
[src]
V: MultiLane<T>,