A factoring algorithm using quadratic residue (Q4955149)

In the authors' words: ``In this paper, we do a study upon an integer factoring algorithm based on a new idea that uses quadratic residue. This method is effective especially on factoring Blum numbers and on \(n=p^2q\) type composite numbers.'' In fact they only consider these two types of numbers, giving for each one of them an ad hoc algorithm: for the Blum integers (a Blum number is an integer of the form \(n=pq\), where \(p,q\) are distinct primes each congruent to 3 modulo 4) they intend to calculate \(\gcd(x^4-a^2, n)\) and for \(n=p^2q \) they propose the calculation of \(\gcd(x^2-a,n)\) (with Jacobi symbol \((a/n)=1\) in the last case). The paper does not study the complexity of the proposed algorithm neither does it compare such an algorithm with other factoring methods, giving only a sample of numerical results.