The authors propose an algorithm based on a class of perturbance to so
lve the short cycle problem for chaotic cryptography systems. The lowe
r bound of the extended cycle length can be specified theoretically, a
nd the original good statistical properties of chaotic dynamics can be
maintained.