Key agreement scheme based on Chebyshev polynomials over finite fields
基于有限域上Chebyshev多项式的密钥协商方案

This paper proposed an improved chaotic map-based key agreement scheme based on RSA algorithm and discrete logarithm on finite fields. At the base of the good properties of Chebyshev polynomials, the scheme utilized the traditional RSA algorithm to forge the Chebyshev polynomial on finite fields and thus ensured the safe of secret key by preventing the kinds of active attacks. Besides, the scheme had the function of identity authentication. At last the theory analysis and experimental results prove the feasibility, correctness, and security of the scheme.