首页 | 本学科首页   官方微博 | 高级检索  
     

基于近似最大公因多项式问题的公钥密码方案
引用本文:于志敏,古春生,景征骏.基于近似最大公因多项式问题的公钥密码方案[J].计算机应用研究,2012,29(7):2690-2692.
作者姓名:于志敏  古春生  景征骏
作者单位:江苏技术师范学院计算机工程学院,江苏常州,213001
基金项目:国家自然科学基金资助项目(70671096); 江苏省常州市“831工程”科研基金资助项目(KYZ08043)
摘    要:研究了有限域F2上有随机噪声的一组多项式的近似最大公因式问题,提出了基于近似最大公因多项式问题的公钥密码方案。证明了方案的正确性并归约证明了方案的安全性等价于求解近似最大公因式问题,同时讨论了对于该方案可能的攻击方式。通过与现有公钥系统比较,该方案的安全性和可靠性较高,运算速度较快。

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

Public key cryptosystem based on approximate greatest common polynomial divisor
YU Zhi-min,GU Chun-sheng,JING Zheng-jun.Public key cryptosystem based on approximate greatest common polynomial divisor[J].Application Research of Computers,2012,29(7):2690-2692.
Authors:YU Zhi-min  GU Chun-sheng  JING Zheng-jun
Affiliation:School of Computer Engineering, Jiangsu Teachers University of Technology, Changzhou Jiangsu 213001, China
Abstract: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.
Keywords:approximate greatest common polynomial divisor  public key cryptosystem  random noise  finite fields  security
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号