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

DOI10.1016/J.CNSNS.2010.04.021zbMATH Open1221.37234OpenAlexW2004458747MaRDI QIDQ718375FDOQ718375

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

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Deterministic Nonperiodic Flow
• The definition of random sequences
• On the Complexity of Finite Sequences
• Visualizing the attraction of strange attractors

Cited In (10)

• Chaotic S-box: intertwining logistic map and bacterial foraging optimization
• Security problems for a pseudorandom sequence generator based on the Chen chaotic system
• Title not available (Why is that?)
• Reducing the Dynamical Degradation by Bi-Coupling Digital Chaotic Maps
• A pseudorandom number generator based on piecewise logistic map
• Improving the pseudo-randomness properties of chaotic maps using deep-zoom
• Study of a new chaotic dynamical system and its usage in a novel pseudorandom bit generator
• Title not available (Why is that?)
• Title not available (Why is that?)
• Bipolar measurement matrix using chaotic sequence

Uses Software

• NIST Statistical Test Suite

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q718375)