计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (10): 73-74.DOI: 10.3778/j.issn.1002-8331.2010.10.024

• 网络、通信、安全 • 上一篇    下一篇

一种强素数因子分解的量子算法

潘 峰1,2,申军伟1   

  1. 1.武警工程学院 电子技术系 网络与信息安全武警部队重点实验室,西安 710086
    2.西安电子科技大学 网络信息安全教育部重点实验室,西安 710071
  • 收稿日期:2009-09-24 修回日期:2010-01-20 出版日期:2010-04-01 发布日期:2010-04-01
  • 通讯作者: 潘 峰1,2

Quantum algorithm for factoring strong primes

PAN Feng1,2,SHEN Jun-wei1   

  1. 1.Key Laboratory of Network & Information Security of APF,Engineering College of APF,Xi’an 710086,China
    2.Key Laboratory of Network & Information Security of the Ministry of Education,Xidian University,Xi’an 710071,China
  • Received:2009-09-24 Revised:2010-01-20 Online:2010-04-01 Published:2010-04-01
  • Contact: PAN Feng1,2

摘要: 深入分析了RSA模数N的强素数因子的特殊结构,进一步确定了2对N的阶δN(2)与Euler函数?准(N)之间的关系,提出了新的分解由强素数因子乘积构成的RSA模N的量子算法,简化了因子分解的过程,提高了运算效率。

关键词: 量子算法, 强素数, RSA分解

Abstract: This paper deeply analyses the special structure of strong primes of the RSA modulus N,and further identifies the relationship between the Euler function ?准(N) and the order δN(2),and proposes a new quantum algorithm for the factorization of the RSA modulus N,a product of two strong primes.This algorithm simplifies the process of factorization and improves its efficiency.

Key words: quantum algorithm, strong prime, RSA factorization

中图分类号: