On Public-Key Encryption Scheme Based on Chebyshev Maps
Due to the exceptionally desirable properties, Chebyshev polynomials have been recently proposed for designing public key cryptosystems. However, some proposed schemes were pointed out to be insecure and unpractical. In this paper, we analyze their defects, discretize the Chebyshev maps, generalize properties of Chebyshev polynomials and design an improved scheme. Theoretical analysis shows that it possesses higher security than RSA and experimental results shows it can be implemented easily.
L. H. Zhang et al., "On Public-Key Encryption Scheme Based on Chebyshev Maps", Advanced Materials Research, Vols. 268-270, pp. 1110-1114, 2011