基于有限域上Chebyshev多项式的密钥协商方案  

Key agreement scheme based on Chebyshev polynomials over finite fields

作　　者：赵耿[1] 孙锦慧[1,2] 赵菲[1,2] 

机构地区：[1]北京电子科技学院,北京100070 [2]西安电子科技大学通信工程学院,西安710071

出　　处：《计算机应用研究》2012年第10期3794-3796,共3页Application Research of Computers

基　　金：国家自然科学基金资助项目(61170037)

摘　　要：利用传统RSA算法和有限域上离散对数问题,提出一种新的基于混沌映射的密钥协商方案。该方案基于有限域上Chebyshev多项式良好的半群特性,运用RSA算法巧妙地隐藏通信双方产生的有限域上的Cheby-shev多项式值,从而避免了以往的种种主动攻击,保证了密钥协商的安全;同时,该密钥协商方案还实现了身份认证功能。理论分析和软件实现证明了该方案的可行性、正确性和安全性。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.

关 键 词：密钥协商 RSA算法 CHEBYSHEV多项式 混沌映射 半群特性 身份认证 

分 类 号：TN915[电子电信—通信与信息系统]