An efficient method for integer factorization

In this paper, we propose an efficient method for integer factorization and it can be a good solution to sieving part of General Number Field Sieve. The mid-size integer factorization module adopts highly parallel structure to save operation time to a great extent. The algorithm used in the factorization module is another highlight that only involves the basic arithmetic operations, which makes for hardware implementation. The major goal of the proposed method is to optimize performance on the aspects of operation time, implemented hardware algorithm and storage space. Additionally, the proposed implementation has absolute advantage at operation speed based on FPGAs, which is of crucial importance for large integer factorization.