Discrete asymptotic deterministic randomness for the generation of pseudorandom bits
From MaRDI portal
Publication:649705
DOI10.1016/j.physleta.2008.12.037zbMath1227.65009OpenAlexW2004317330MaRDI QIDQ649705
Xubo Hou, Song Hong, Kai Wang, Zhenya He, Wen-Jiang Pei
Publication date: 5 December 2011
Published in: Physics Letters. A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.physleta.2008.12.037
Other physical applications of random processes (60K40) Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45)
Related Items (1)
Cites Work
- Theory and practice of chaotic cryptography
- On chaotic and random sequences
- Pseudo-random number generator based on asymptotic deterministic randomness
- Discrete entropy
- Guaranteeing the diversity of number generators
- From exactly solvable chaotic maps to stochastic dynamics
- Exact solutions to chaotic and stochastic systems
- Chaos-based random number generators-part I: analysis [cryptography]
- Chaos-based random number generators. Part II: practical realization
- A Class of Maximum-Period Nonlinear Congruential Generators Derived From the Rényi Chaotic Map
- True Random Bit Generation From a Double-Scroll Attractor
- A feedback strategy to improve the entropy of a chaos-based random bit generator
- Discrete Chaos-I: Theory
- Designing security for number sequences generated by means of the sawtooth chaotic map
- Pseudorandom bits generated by chaotic maps
- A mechanism for randomness
This page was built for publication: Discrete asymptotic deterministic randomness for the generation of pseudorandom bits
