New Research on Elliptic Curve Cryptosystem Algorithm Based on System of Chebyshev Polynomial

Author

Guang-Zheng Wei ; Geng Zhao ; Ming-lai Liu ; Shao-po Zhang

Author_Institution

Beijing Electron. Sci. & Technol. Inst., Beijing, China

fYear

2013

fDate

14-15 Dec. 2013

Firstpage

82

Lastpage

85

Abstract

It is the first time to combine Chebyshev Polynomial with Elliptic Curve. In this paper it construct a Elliptic Curve Cryptosystem Algorithm based on Chebyshev Polynomial. This paper use the semi-groop Character of the Chebyshev and the character of the Elliptic Curve to make a Cryptosystem Algorithm in the Elliptic Curve. This Algorithm has solved the problem that it can´t get inversion in the process of decrypting the message. This Algorithm has the advantages of the Chaotic and Elliptic Curve Cryptographic Algorithm. Through the analysis of the Algorithm, it is thought that the Algorithm is simple and has high safety and the scheme is feasible.

Keywords

Chebyshev approximation; polynomials; public key cryptography; Chebyshev polynomial; chaotic algorithm; elliptic curve cryptographic algorithm; elliptic curve cryptosystem algorithm; message decryption; semi-groop character; Algorithm design and analysis; Chaotic communication; Chebyshev approximation; Elliptic curve cryptography; Elliptic curves; Encryption; Chaotic; Chebyshev Polynomial; Elliptic Curve Algorithm; Inversion;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Sciences and Applications (CSA), 2013 International Conference on

Conference_Location

Wuhan

Type

conf

DOI

10.1109/CSA.2013.25

Filename

6835551