基于近似最大公因多项式问题的公钥密码方案  

Public key cryptosystem based on approximate greatest common polynomial divisor

作　　者：于志敏[1] 古春生[1] 景征骏[1] 

机构地区：[1]江苏技术师范学院计算机工程学院,江苏常州213001

出　　处：《计算机应用研究》2012年第7期2690-2692,2699,共4页Application Research of Computers

基　　金：国家自然科学基金资助项目(70671096);江苏省常州市"831工程"科研基金资助项目(KYZ08043)

摘　　要：研究了有限域F2上有随机噪声的一组多项式的近似最大公因式问题,提出了基于近似最大公因多项式问题的公钥密码方案。证明了方案的正确性并归约证明了方案的安全性等价于求解近似最大公因式问题,同时讨论了对于该方案可能的攻击方式。通过与现有公钥系统比较,该方案的安全性和可靠性较高,运算速度较快。This paper considered the approximate greatest common polynomial divisor problem for a set of polynomials with random noise over finite field F2 and presented a new public key cryptosystem based on the approximate greatest common polynomial divisor over finite field.It proved the correctness of this public key scheme,and reduced the security of this public key scheme to solving approximate greatest common polynomial divisor problem.Then discussed some possible attack for this cryptosystem.Compared with the existing public key systems,this cryptosystem has the faster calculating speed,higher security and reliability.

关 键 词：近似最大公因多项式 公钥密码方案 随机噪声 有限域 安全性 

分 类 号：TP393.07[自动化与计算机技术—计算机应用技术]