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

Read the full article See related articles

Listed in

This article is not in any list yet, why not save it to one of your lists.
Log in to save this article

Abstract

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.

Article activity feed