Optimization of Quadratic Sieve Algorithm Implementation for Large Integer Factorization

The quadratic sieve method is a core tool in number theory. In this paper, we present two optimization methods for the Quadratic Sieve algorithm. In the sieving process, the original polynomial root value accumulation step is changed from the original di to the mdi (m is a small integer), which can change the complexity from O(n) to O(n/m). Another optimization method is that for all parameter lookup steps, the original traversal lookup can be changed to an efficient binary search, which can change the complexity of the loop from O(n) to O(logn). This enhancement reduces the computational complexity of RSA modulus factorization in practical settings.