Discrete asymptotic deterministic randomness for the generation of pseudorandom bits
DOI10.1016/J.PHYSLETA.2008.12.037zbMATH Open1227.65009OpenAlexW2004317330MaRDI QIDQ649705FDOQ649705
Xubo Hou, Song Hong, Wenjiang Pei, Kai Wang, Zhenya He
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
Recommendations
- Pseudo-random number generator based on asymptotic deterministic randomness
- Pseudorandom number generators based on chaotic dynamical systems
- An asymptotically perfect pseudorandom generator
- scientific article; zbMATH DE number 2051018
- Quantifiers for randomness of chaotic pseudo-random number generators
Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45) Other physical applications of random processes (60K40)
Cites Work
- Chaos-based random number generators-part I: analysis [cryptography]
- Pseudorandom bits generated by chaotic maps
- Theory and practice of chaotic cryptography
- A feedback strategy to improve the entropy of a chaos-based random bit generator
- Discrete Chaos-I: Theory
- Pseudo-random number generator based on asymptotic deterministic randomness
- Chaos-based random number generators. Part II: practical realization
- A Class of Maximum-Period Nonlinear Congruential Generators Derived From the Rényi Chaotic Map
- From exactly solvable chaotic maps to stochastic dynamics
- Exact solutions to chaotic and stochastic systems
- True Random Bit Generation From a Double-Scroll Attractor
- Designing security for number sequences generated by means of the sawtooth chaotic map
- A mechanism for randomness
- Discrete entropy
- Guaranteeing the diversity of number generators
- On chaotic and random sequences
Cited In (7)
- An asymptotically perfect pseudorandom generator
- Bit commitment using pseudorandomness
- A Generalization of Peres’s Algorithm for Generating Random Bits From Loaded Dice
- Randomness of Low-Order Bits in Random Number Generators
- Generating random bits from an arbitrary source: fundamental limits
- Efficient Pseudorandom Generators Based on the DDH Assumption
- The variable-interval arithmetic coding using asymptotic deterministic randomness for data compression and encryption
This page was built for publication: Discrete asymptotic deterministic randomness for the generation of pseudorandom bits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q649705)
