%0 Journal Article
%T Key agreement scheme based on Chebyshev polynomials over finite fields<br>基于有限域上Chebyshev多项式的密钥协商方案
%A ZHAO Geng
%A SUN Jin-hui
%A ZHAO Fei
%A <br>赵　耿
%A 孙锦慧
%A 赵　菲
%J 计算机应用研究
%D 2012
%I 
%X 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.
%K key agreement
%K RSA algorithm
%K Chebyshev polynomials
%K chaotic map
%K semi-group property
%K identity authentication<br>密钥协商
%K RSA算法
%K Chebyshev多项式
%K 混沌映射
%K 半群特性
%K 身份认证
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=38AAB79AD8A56B53C6E5C3DBC2F3CB04&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=F3090AE9B60B7ED1&sid=73EB350D0ECEA999&eid=B202339DF2CFEC77&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=10