It is well-known that the security of the most famous and widely used public-key crypto-system RSA relies on the computational intractability of the integer factorization problem. In this paper, we shall discuss some new directions and new developments in integer factorization, and their implications in the cryptanalysis of RSA and other factoring-based cryptosystems.%整数分解是数论中的一个非常古老的计算难解性问题,至今仍然没有一个快速的满意的解决办法,而当今世界最有名气、应用最为广泛的RSA密码体制,其安全性就是基于整数分解的难解性的.本文力图介绍整数分解的若干重要算法、当今整数分解领域中的最新研究方向和最新研究动态,以及它们对RSA密码破译工作的作用和影响.
展开▼