基于实数域扩散离散Chebyshev多项式的公钥加密算法  

Public-key Encryption Based on Extending Discrete Chebyshev Polynomials' Definition Domain to Real Number

作　　者：陈宇[1] 韦鹏程[1] 

机构地区：[1]重庆教育学院计算机科学系,重庆400067

出　　处：《计算机科学》2011年第10期121-122,165,共3页Computer Science

基　　金：国家自然科学基金项目(60703035);重庆市自然科学基金项目(2009BBB2227);重庆市教委项目(KJ091501;KJ091502;KJ101501;KJ101502)资助

摘　　要：将Chebyshev多项式与模运算相结合,对其定义在实数域上进行了扩展,经过理论验证和数据分析,总结出实数域多项式应用于公钥密码的一些性质。利用RSA公钥算法和ElGamal公钥算法的算法结构,提出基于有限域离散Chebyshev多项式的公钥密码算法。该算法结构类似于RSA算法,其安全性基于大数因式分解的难度或者与El-Gamal的离散对数难度相当,能够抵抗对于RSA的选择密文攻击,并且易于软件实现。By combining Chebyshev polynomials with modulus compute,extending Chebyshev polynomials＇ definition domain to real number,some conclusions were drawn by theoretic verification and data analysis.Making use of the framework of the traditional public-key algorithm RSA and ElGamal,proposed a chaotic public-key encryption algorithm based on extending discrete Chebyshev polynomials＇ definition domain to Real number.Its security is based on the intractability of the integer factorization problem as RSA,and it is able to resist the chosen cipher-text attack against RSA and easy to be implemented.

关 键 词：公钥加密 CHEBYSHEV多项式 实数域 混沌映射 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]