Pseudo-randomness and complexity of binary sequences generated by the chaotic system

DOI10.1016/j.cnsns.2010.04.021zbMath1221.37234OpenAlexW2004458747MaRDI QIDQ718375

Nian-Sheng Liu

Publication date: 23 September 2011

Published in: Communications in Nonlinear Science and Numerical Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cnsns.2010.04.021

zbMATH Keywords

pseudo-randomnesschaotic binary sequencesequence complexity

Mathematics Subject Classification ID

Applications of dynamical systems (37N99) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45)

Related Items (6)

Security problems for a pseudorandom sequence generator based on the Chen chaotic system ⋮ A pseudorandom number generator based on piecewise logistic map ⋮ Reducing the Dynamical Degradation by Bi-Coupling Digital Chaotic Maps ⋮ Bipolar measurement matrix using chaotic sequence ⋮ Improving the pseudo-randomness properties of chaotic maps using deep-zoom ⋮ Chaotic S-box: intertwining logistic map and bacterial foraging optimization

Uses Software

• NIST Statistical Test Suite

Cites Work

• On the Complexity of Finite Sequences
• Deterministic Nonperiodic Flow
• The definition of random sequences
• Visualizing the attraction of strange attractors
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Pseudo-randomness and complexity of binary sequences generated by the chaotic system