On the Effectivenes of a Common Attack to Chebyshev Chaotic Encryption Scheme

Chebyshev polynomials define a rather canonical chaotic cryptosystem and some rather strong attacks have been found. We report the numerical experiments within this cryptosystem and we point out the relevance of the length of plaintexts and the precision of the arithmetical calculations in the cryptosystem robustness.