Pseudo-randomness and complexity of binary sequences generated by the chaotic system
From MaRDI portal
Publication:718375
Recommendations
- Evaluating the randomness of chaotic binary sequences via a novel period detection algorithm
- Binary Pseudo-Random Sequences Theory
- Cryptographic pseudo-random sequences from the chaotic Hénon map
- Chaotic sequences as pseudo-random sequences obtained from 2-dimensional maps
- The complexity analysis of TD-ERCS discrete chaotic pseudo-random sequences
Cites work
- scientific article; zbMATH DE number 5830819 (Why is no real title available?)
- scientific article; zbMATH DE number 5018180 (Why is no real title available?)
- scientific article; zbMATH DE number 5167238 (Why is no real title available?)
- Deterministic Nonperiodic Flow
- On the Complexity of Finite Sequences
- The definition of random sequences
- Visualizing the attraction of strange attractors
Cited in
(16)- Application of the FuzzyEn algorithm to the complexity analysis of chaotic sequences
- Chaotic S-box: intertwining logistic map and bacterial foraging optimization
- Evaluating the randomness of chaotic binary sequences via a novel period detection algorithm
- Research on the stability of complexity of chaos-based pseudorandom sequence
- Security problems for a pseudorandom sequence generator based on the Chen chaotic system
- scientific article; zbMATH DE number 4135865 (Why is no real title available?)
- Reducing the Dynamical Degradation by Bi-Coupling Digital Chaotic Maps
- A pseudorandom number generator based on piecewise logistic map
- Study of a new chaotic dynamical system and its usage in a novel pseudorandom bit generator
- Improving the pseudo-randomness properties of chaotic maps using deep-zoom
- scientific article; zbMATH DE number 6539376 (Why is no real title available?)
- Chaotic sequences as pseudo-random sequences obtained from 2-dimensional maps
- scientific article; zbMATH DE number 1740048 (Why is no real title available?)
- Bipolar measurement matrix using chaotic sequence
- The complexity analysis of TD-ERCS discrete chaotic pseudo-random sequences
- A universal algorithm for transforming chaotic sequences into uniform pseudo-random sequences
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)