A New Parallel Integer Factorization Algorithm based on Simple Continued Fraction Expansion of √𝑁

I propose a new factorization algorithm based on residues from the expansion in continued fractions of the square root of the number to be factored. The algorithm searches for repeated residues and, from these, and from the respective convergents, associated with these residues, determines the factors of the number.