A new elliptic curve cryptosystem algorithm based on the system of chebyshev polynomial

We constructed elliptic curve cryptography that based on chebyshev polynomial algorithm by combining chebyshev polynomial and the elliptic curve. Using chebyshev good semigroup characteristics over unite Held and the nature on the elliptic curve, realized the algorithm on the elliptic curve encryption. This algorithm has solved the problem that we can't get inverse in the process of restoring the original text, and it has the advantages of chaotic cryptographic algorithms and elliptic curve cryptographic algorithms. The analysis of the algorithm shows that algorithm is a simple, high safety and feasible system.

[1]  Eli Biham,et al.  Differential cryptanalysis of DES-like cryptosystems , 1990, Journal of Cryptology.

[2]  Ljupco Kocarev,et al.  Public-key encryption with chaos. , 2004, Chaos.

[3]  Stafford E. Tavares,et al.  On the Design of S-Boxes , 1985, CRYPTO.

[4]  Dahu Wang,et al.  An Identity Authentication System Based on Chebyshev Polynomials , 2009, 2009 First International Conference on Information Science and Engineering.

[5]  Stafford E. Tavares,et al.  Constructing Large Cryptographically Strong S-boxes , 1992, AUSCRYPT.

[6]  Ljupco Kocarev,et al.  Public-key encryption based on Chebyshev maps , 2003, Proceedings of the 2003 International Symposium on Circuits and Systems, 2003. ISCAS '03..

[7]  Alfredo De Santis,et al.  Security of public-key cryptosystems based on Chebyshev polynomials , 2004, IEEE Transactions on Circuits and Systems I: Regular Papers.