On Public-Key Encryption Scheme Based on Chebyshev Maps

Abstract:

Article Preview

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.

Info:

Periodical:

Advanced Materials Research (Volumes 268-270)

Edited by:

Feng Xiong

Pages:

1110-1114

DOI:

10.4028/www.scientific.net/AMR.268-270.1110

Citation:

L. H. Zhang et al., "On Public-Key Encryption Scheme Based on Chebyshev Maps", Advanced Materials Research, Vols. 268-270, pp. 1110-1114, 2011

Online since:

July 2011

Export:

Price:

$35.00

In order to see related information, you need to Login.

In order to see related information, you need to Login.