Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (10): 73-74.DOI: 10.3778/j.issn.1002-8331.2010.10.024
• 网络、通信、安全 • Previous Articles Next Articles
PAN Feng1,2,SHEN Jun-wei1
Received:
Revised:
Online:
Published:
Contact:
潘 峰1,2,申军伟1
通讯作者:
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
摘要: 深入分析了RSA模数N的强素数因子的特殊结构,进一步确定了2对N的阶δN(2)与Euler函数?准(N)之间的关系,提出了新的分解由强素数因子乘积构成的RSA模N的量子算法,简化了因子分解的过程,提高了运算效率。
关键词: 量子算法, 强素数, RSA分解
CLC Number:
TP309
PAN Feng1,2,SHEN Jun-wei1. Quantum algorithm for factoring strong primes[J]. Computer Engineering and Applications, 2010, 46(10): 73-74.
潘 峰1,2,申军伟1. 一种强素数因子分解的量子算法[J]. 计算机工程与应用, 2010, 46(10): 73-74.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/10.3778/j.issn.1002-8331.2010.10.024
http://cea.ceaj.org/EN/Y2010/V46/I10/73