Robust chaos of cubic polynomial discrete maps with application to pseudorandom number generators
Summary: Based on the robust chaos theorem of S-unimodal maps, this paper studies a kind of cubic polynomial discrete maps (CPDMs) and sets up a novel theorem. This theorem gives general conditions for the occurrence of robust chaos in the CPDMs. By using the theorem, we construct a CPDM. The parameter regions of chaotic robustness of the CPDM are larger than these of Logistic map. By using a fixed point arithmetic, we investigate the cycle lengths of the CPDM and a Logistic map. The results show that the maximum cycle lengths of \(1000\) chaotic sequences with length \(3 \times 1 0^7\) generated by different initial value conditions exponentially increase with the resolutions. When the resolutions reach \(1 0^{- 7} \sim 1 0^{- 13}\), the maximum cycle lengths of the cubic polynomial chaotic sequences are significantly greater than these of the Logistic map. When the resolution reaches \(1 0^{- 14}\), there is the situation without cycle for \(1000\) cubic polynomial chaotic sequences with length \(3 \times 1 0^7\). By using the CPDM and Logistic map, we design four chaos-based pseudorandom number generators (CPRNGs): CPRNGI, CPRNGII, CPRNGIII, and CPRNGIV. The randomness of two \(1000\) key streams consisting of \(20000\) bits is tested, respectively, generated by the four CPRNGs. The result suggests that CPRNGIII based on the cubic polynomial chaotic generalized synchronic system has better performance.
- A cubic map chaos criterion theorem with applications in generalized synchronization based pseudorandom number generator and image encryption
- Chaos-based random number generators-part I: analysis [cryptography]
- A pseudo-random number generator using a three-dimensional chaotic map
- A chaos robustness criterion for 2D piecewise smooth map with applications in pseudorandom number generator and image encryption with avalanche effect
- Pseudorandom number generators based on chaotic dynamical systems
- A cubic map chaos criterion theorem with applications in generalized synchronization based pseudorandom number generator and image encryption
- Complete convergence for weighted sums of END random variables and its application to nonparametric regression models
- Cycle lengths and correlation properties of finite precision chaotic maps
- Digital-analog hybrid scheme and its application to chaotic random number generators
- Discrimination of the 3-periodic points of a quadratic polynomial
- Exponential random simplicial complexes
- scientific article; zbMATH DE number 1099195 (Why is no real title available?)
- scientific article; zbMATH DE number 1866304 (Why is no real title available?)
- Monte Carlo simulation in statistical physics. An introduction.
- On the \(\mathbb{F}_2\)-linear relations of Mersenne Twister pseudorandom number generators
- Period Three Implies Chaos
- Random numbers from a delay equation
- Stable Orbits and Bifurcation of Maps of the Interval
- Strong law of large numbers for continuous random dynamical systems
- The entropy of a distributed computation random number generation from memory interleaving
- Random Walk in a N-Cube Without Hamiltonian Cycle to Chaotic Pseudorandom Number Generation: Theoretical and Practical Considerations
- A cubic map chaos criterion theorem with applications in generalized synchronization based pseudorandom number generator and image encryption
- A novel family of 1-D robust chaotic maps
This page was built for publication: Robust chaos of cubic polynomial discrete maps with application to pseudorandom number generators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2298835)
