Discrete asymptotic deterministic randomness for the generation of pseudorandom bits

DOI10.1016/J.PHYSLETA.2008.12.037MaRDI QIDQ649705zbMATH OpenOpenAlexFDO

Authors Kai Wang, Xubo Hou, Song Hong, Zhenya He, Wenjiang 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

zbMATH Keywords

discrete asymptotic deterministic randomnessmulti-value correspondencePRBG

Mathematics Subject Classification ID

Random number generation in numerical analysis (65C10) Pseudo-random numbers; Monte Carlo methods (11K45) Other physical applications of random processes (60K40)

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

Cites work

• A Class of Maximum-Period Nonlinear Congruential Generators Derived From the Rényi Chaotic Map
• A feedback strategy to improve the entropy of a chaos-based random bit generator
• A mechanism for randomness
• Chaos-based random number generators-part I: analysis [cryptography]
• Chaos-based random number generators. Part II: practical realization
• Designing security for number sequences generated by means of the sawtooth chaotic map
• Discrete Chaos-I: Theory
• Discrete entropy
• Exact solutions to chaotic and stochastic systems
• From exactly solvable chaotic maps to stochastic dynamics
• Guaranteeing the diversity of number generators
• On chaotic and random sequences
• Pseudo-random number generator based on asymptotic deterministic randomness
• Pseudorandom bits generated by chaotic maps
• Theory and practice of chaotic cryptography
• True Random Bit Generation From a Double-Scroll Attractor

Cited in

(8)

• Pseudo-random number generator based on asymptotic deterministic randomness
• 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)