Shanks' square forms factorization

Shanks's square forms factorization is a method for integer factorization devised by Daniel Shanks as an improvement on Fermat's factorization method.

The success of Fermat's method depends on finding integers $x$ and $y$ such that $x^2-y^2=N$, where $N$ is the integer to be factored. An improvement (noticed by Kraitchik) is to look for integers $x$ and $y$ such that $x^2\equiv y^2\pmod{N}$. Finding a suitable pair $(x, y)$ does not guarantee a factorization of $N$, but it implies that $N$ is a factor of $x^2-y^2=(x-y)(x+y)$, and there is a good chance that the prime divisors of $N$ are distributed between these two factors, so that calculation of the greatest common divisor of $N$ and $x-y$ will give a non-trivial factor of $N$.

A practical algorithm for finding pairs $(x,y)$ which satisfy $x^2\equiv y^2\pmod{N}$ was developed by Shanks, who named it Square Forms Factorization or SQUFOF. The algorithm can be expressed in terms of continued fractions or in terms of quadratic forms. Although there are now much more efficient factorization methods available, SQUFOF has the advantage that it is small enough to be implemented on a programmable calculator.

Algorithm

Input: $N$, the integer to be factored, which must be neither a prime number nor a perfect square, and a small multiplier $k$.

Output: a non-trivial factor of $N$.

The algorithm:

Initialize $P_0=\lfloor\sqrt{kN}\rfloor,Q_0=1,Q_1=kN-P_0^2.$

Repeat

$b_i=\left\lfloor\frac{\lfloor\sqrt{kN}\rfloor+P_{i-1}}{Q_i}\right\rfloor,P_i=b_iQ_i-P_{i-1},Q_{i+1}=Q_{i-1}+b_i(P_{i-1}-P_i)$

until $Q_i$ is a perfect square at some even $i$.

Initialize $b_0=\left\lfloor\frac{\lfloor\sqrt{kN}\rfloor-P_{i-1}}{\sqrt{Q_i}}\right\rfloor,P_0=b_0\sqrt{Q_i}+P_{i-1},Q_0=\sqrt{Q_i},Q_1=\frac{kN-P_0^2}{Q_0}$

Repeat

$b_i=\left\lfloor\frac{\lfloor\sqrt{kN}\rfloor+P_{i-1}}{Q_i}\right\rfloor,P_i=b_iQ_i-P_{i-1},Q_{i+1}=Q_{i-1}+b_i(P_{i-1}-P_i)$

until $P_i=P_{i-1}.$

Then if $f=\gcd(N,P_i)$ is not equal to $1$ and not equal to $N$, then $f$ is a non-trivial factor of $N$. Otherwise try another value of $k$.

Shanks's method has time complexity $O(\sqrt[4]{N})$.

Stephen S. McMasters (see link in External Link section) wrote a more detailed discussion of the mathematics of Shanks's method, together with a proof of its correctness.

Example

N = 11111, k = 1

P₀ = 105 Q₀ = 1 Q₁ = 86

P₁ = 67 Q₁ = 86 Q₂ = 77

P₂ = 87 Q₂ = 77 Q₃ = 46

P₃ = 97 Q₃ = 46 Q₄ = 37

P₄ = 88 Q₄ = 37 Q₅ = 91

P₅ = 94 Q₅ = 91 Q₆ = 25

Here Q₆ is a perfect square

P₀ = 104 Q₀ = 5 Q₁ = 59

P₁ = 73 Q₁ = 59 Q₂ = 98

P₂ = 25 Q₂ = 98 Q₃ = 107

P₃ = 82 Q₃ = 107 Q₄ = 41

P₄ = 82

Here P₃ = P₄

gcd(11111, 82) = 41, which is a factor of 11111.

Implementations

The PSIQS Java package contains a SquFoF implementation.

References

• D. A. Buell (1989). Binary Quadratic Forms. Springer-Verlag. ISBN 0-387-97037-1.
• D. M. Bressoud (1989). Factorisation and Primality Testing. Springer-Verlag. ISBN 0-387-97040-1.
• Riesel, Hans (1994). Prime numbers and computer methods for factorization (2nd ed.). Birkhauser. ISBN 0-8176-3743-5.

External links

• Daniel Shanks: Analysis and Improvement of the Continued Fraction Method of Factorization, (transcribed by S. McMath 2004)
• Daniel Shanks: SQUFOF Notes, (transcribed by S. McMath 2004)
• Stephen McMath: Daniel Shanks’s Square Forms Factorization (Nov. 2004)
• Stephen S. McMath: Parallel integer factorization using quadratic forms, 2005
• S. McMath, F. Crabbe, D. Joyner: Continued fractions and parallel SQUFOF, 2005
• Jason Gower, Samuel Wagstaff: Square Form Factorisation (Published)
• Shanks' SQUFOF Factoring Algorithm