Integer Factorization via Continued Fractions and Quadratic Forms
Integer Factorization via Continued Fractions and Quadratic Forms
We propose a novel factorization algorithm that leverages the theory underlying the SQUFOF method, including reduced quadratic forms, infrastructural distance, and Gauss composition. We also present an analysis of our method, which has a computational complexity of $O \left( \exp \left( \frac{3}{\sqrt{8}} \sqrt{\ln N \ln \ln N} \right) \right)$, making …