A non-linear pseudo-random number generator based on chaos theory [3] was criticized for producing cycling keys if used with low-precision arithmetic [4]. We present here the results of a numerical investigation of the algorithm's properties using a Cray Y-MP machine. This suggests that the cycling problem can be combatted to any desired degree. We conclude that the generator is still of cryptographic interest.