Public key encryption algorithm based on Chebyshev polynomials over finite fields

International Conference on Signal Processing Proceedings, ICSP

Volumn 4, Issue , 2007, Pages

  Ning, Hongzhou ^a   Liu, Yun ^a   He, Dequan ^a  

^a BEIJING JIAOTONG UNIVERSITY   (China)

Author keywords

Public key encryption Chebyshev polynomials finite fields

Indexed keywords

ALGORITHMS; FUNCTIONS; NUMBER THEORY; POLYNOMIAL APPROXIMATION; PUBLIC KEY CRYPTOGRAPHY; RANDOM PROCESSES;

CHEBYSHEV POLYNOMIALS; DIVERGENT SYSTEM; FINITE FIELDS; PRIME NUMBERS; PRIMITIVE ELEMENTS;

CHEBYSHEV APPROXIMATION;

EID: 34249280929     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICOSP.2006.345958     Document Type: Conference Paper

References (7)

1. Diffie W. and Hellman M.E., New directions in cryptography, Information Theory, IEEE, 1976, 22(6): pp. 644-654.
2. Rivest R.L., Shamir A. and Adleman L., Method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, 1978, 21(2): pp. 120-126.
3. Rivest R.L., Shamir A. and Adleman L., On digital signatures and public key cryptosystems, MIT Laboratory for Computer Science, Technical Report, 1979.
4. Elgamal T., A public key cryptosystem and a signature scheme based on discrete logarithms, Information Theory, IEEE, 1985, 31(4): pp. 469-472.
5. Elgamal T., A public key cryptosystem and a signature scheme based on discrete logarithms, CRYPTO 84 on Advances in Cryptology Proceedings, Springer-Verlag, 1984, pp. 10-18.
6. Kocarev L. and Tasev Z., Public-key encryption based on Chebyshev maps, The 2003 IEEE International Symposium on Circuits and Systems Proceedings, 2003, pp. 28-31.
7. Pina Bergamo, Paolo D'Arco and Alfredo De Santis, et al., Security of public key cryptosystems based on Chebyshev polynomials, IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications, 2005, 52(7): pp. 1382-1393.