Integer Factorization
Published • Nov 27, 2012
Authors:
Song Y. Yan
Abstract
This chapter discusses several important modern algorithms for factoring, including Lenstra's Elliptic Curve Method (ECM), Pomerance's Quadratic Sieve (QS), and Number Field Sieve (NFS) method. The IFP is an infeasible problem from a computational complexity point of view since there is no polynomia...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!