Answers are grounded in this paper and cite their sources.
The authors propose an algorithm based on a class of perturbance to solve the short cycle problem for chaotic cryptography systems. The lower bound of the extended cycle length can be specified theoretically, and the original good statistical properties of chaotic dynamics can be maintained.
No takes yet. Share an insight, caveat, or question.
Tao et al. (1998) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: