Research on Elliptic Curve Cryptographic Algorithms Based on Chaotic System

Pseudo random number produced by Chebyshev polynomial, Simplifying the knapsack cryptosystem, At the same time combining knapsack cryptosystem and elliptic curve cryptosystem, A new elliptic curve cryptosystem is produced, Through the analysis of the algorithm, it is thought that the algorithm is simple and has high safety, the scheme is feasible.

[1]  Yupu Hu,et al.  A knapsack-based probabilistic encryption scheme , 2007, Inf. Sci..

[2]  Bill Hancock,et al.  Elliptical curve cryptography and standards for efficient cryptography group , 1999, Computers & security.

[3]  Claude E. Shannon,et al.  Communication theory of secrecy systems , 1949, Bell Syst. Tech. J..

[4]  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..

[5]  Ian F. Blake,et al.  Elliptic curves in cryptography , 1999 .

[6]  Christof Paar,et al.  Efficient Algorithms for Elliptic Curve Cryptosystems , 1997, CRYPTO.

[7]  Chi-Sung Laih,et al.  Linearly shift knapsack public-key cryptosystem , 1989, IEEE J. Sel. Areas Commun..

[8]  Behrouz A. Forouzan,et al.  Cryptography and network security , 1998 .