%0 Journal Article
%T Recent Progress of Integer Factorization Algorithms and Challenges Faced by the Traditional Cryptology<br>整数质因子分解算法新进展与传统密码学面临的挑战
%A DONG Qing WU Nan
%A <br>董青
%A 吴楠
%J 计算机科学
%D 2008
%I 
%X Integer factorization is one of the most important fields in modern number theory,and in this field there are still many open problems.When facing the information era,the complexity of the integer factorization plays a key role and is an important theoretical basis of modern cryptology.The security of the famous RSA public-key cryptosystem is typically based on the difficulty of this problem.This paper surveys several traditional algorithms of number theory for solving the integer factorization problem whic...
%K Integer factorization
%K Algorithm
%K Complexity
%K Data security
%K Quantum computer
%K Quantum algorithm
%K Quantum cryptology<br>整数因子分解
%K 算法
%K 复杂度
%K 数据安全
%K 量子计算机
%K 量子算法
%K 量子密码学
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=BD4ADCD5BF629241E734BA710D061FDC&yid=67289AFF6305E306&vid=6209D9E8050195F5&iid=5D311CA918CA9A03&sid=BCA2697F357F2001&eid=A04140E723CB732E&journal_id=1002-137X&journal_name=计算机科学&referenced_num=1&reference_num=21