Proved Random Numbers Obtained from Hardware Devices
From MaRDI portal
Publication:5415900
DOI10.1080/03610918.2012.725143zbMath1302.65022OpenAlexW2110892992MaRDI QIDQ5415900
Publication date: 19 May 2014
Published in: Communications in Statistics - Simulation and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03610918.2012.725143
central limit theoremFibonacci sequencerandom numbersdependenceextractorshigher order correlation coefficientscorrect modelsXOR limit theorem
Random number generation in numerical analysis (65C10) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)
Cites Work
- Unnamed Item
- Unnamed Item
- Generating quasi-random sequences from semi-random sources
- Iterating von Neumann's procedure for extracting random bits
- Some characterizations of the uniform distribution with applications to random number generation
- Extracting randomness: A survey and new constructions
- A new weak dependence condition and applications to moment inequalities
- Central limit theorem by polynomial dependence coefficients
- Central limit theorem by moments
- Higher Order Correlation Coefficients
- Deterministic Extractors for Bit‐Fixing Sources by Obtaining an Independent Seed
- Extracting Randomness Using Few Independent Sources
- Deterministic extractors for small-space sources
- Extracting all the randomness and reducing the error in Trevisan's extractors