期刊文献+

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

Public key cryptosystem based on approximate greatest common polynomial divisor
在线阅读 下载PDF
导出
摘要 研究了有限域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.
出处 《计算机应用研究》 CSCD 北大核心 2012年第7期2690-2692,2699,共4页 Application Research of Computers
基金 国家自然科学基金资助项目(70671096) 江苏省常州市"831工程"科研基金资助项目(KYZ08043)
关键词 近似最大公因多项式 公钥密码方案 随机噪声 有限域 安全性 approximate greatest common polynomial divisor public key cryptosystem random noise finite fields security
  • 相关文献

参考文献13

  • 1SHOR P W. Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer[J].SIAM Journal on Computing,1997,(05):1484-1509.doi:10.1137/S0097539795293172.
  • 2PROOS J,ZALKA C. Shor' s discrete logarithm quantum algorithm for elliptic curves[J].Quantum Information and Computation,2003,(04):317-344.
  • 3HOFFSTEIN J,PIPHER J,SILVERMAN J H. NTRU:a ring-based public key cryptosystem[A].Lodon:Springer-Verlag,1998.267-288.
  • 4AJTAI M,DWORK C. A public-key cryptosystem with worst-case/average-case equivalence[A].New York:ACM,1997.284-293.
  • 5REGEV O. New lattice-based cryptographic constructions[J].Journal of the ACM,2004,(06):899-942.
  • 6PEIKERT C. Public-key cryptosystems from the worst-case shortest vector problem[A].New York:AC M,2009.333-342.
  • 7GOLDREICH O,GOLDWASSER S. On the limits of nonapproximability of lattice problems[J].Journal of Computer and Systems Sciences,2000,(03):540-563.
  • 8AHARONOV D,REGEV O. Lattice problems in NP ∩ coNP[J].Journal of the ACM,2005,(05):749-765.doi:10.1145/1089023.1089025.
  • 9KALTOFEN E,SHOUP V. Subquadratic-time factoring of polynomials over finite fields[J].Mathematics of Computation,1998,(223):1179-1197.doi:10.1090/S0025-5718-98-00944-2.
  • 10(l)uyuanhong.任取两个正整数,它们互素的概率为6/π^2.

二级参考文献11

  • 1史天勤.周期点计数及费马小定理的推广[J].长春大学学报,1995,5(3):43-46. 被引量:1
  • 2William Stallings.密码编码学与网络安全:原理与实践[M].第2版.杨明,胥光辉,齐望东,译.北京:电子工业出版社,2001.
  • 3Rivest R, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystem [J]. Communications of the ACM, 1978,21 (2): 120-126.
  • 4Ananda Mohan. Fast algorithms for implementation of montgomery's modular multiplication tee hnique [J]. Circuits, Systems and Signal Processing, 2004,23 (6): 463-478.
  • 5Bunimov V, Schimmler M. Area and Time Efficient Modular Multiplication of Large Integers [C]//IEEE 14th International Conference on Applicat ion specific Systems, Architectures and Process ors. Washington, DC, 2003: 400-409.
  • 6Schimmler Mantled, Bunimov Viktor. Fast Modular Multiplication by Operand Changing [J]. International on Information Technology: Coding and Computing, 2004,2:518-524
  • 7Yen Sung-Ming, Kim Seungjoo, Lim Seongan, et al.. RSA Speedup with Chinese Remainder Theorem Immune against Hardware Fault Cryptanalysis [J]. IEEE transactions on computers, 2003,52 (4): 461-472.
  • 8Carpinelli John D, Dokachev Michael. The wallace tree simulator [J]. Computers in Education Journal, 2004,14 (3): 10-14.
  • 9陈运,龚耀寰.基于二进制冗余数的递归余数和算法[J].电子科技大学学报,2000,29(1):1-4. 被引量:8
  • 10刘宏伟,王昭顺,班晓娟.RSA公钥密码体制的实现研究[J].计算机工程与应用,2002,38(17):52-54. 被引量:19

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部