congruence of squares

In number theory, a congruence of squares is a congruence commonly used in integer factorization algorithms.

Derivation

Given a positive integer ''n'', Fermat's factorization method relies on finding numbers ''x'' and ''y'' satisfying the equality

:$x^2 - y^2 = n$

We can then factor ''n'' = ''x''² − ''y''² = (''x'' + ''y'')(''x'' − ''y''). This algorithm is slow in practice because we need to search many such numbers, and only a few satisfy the equation. However, ''n'' may also be factored if we can satisfy the weaker congruence of squares condition:

:$x^2 \equiv y^2 \pmod$
:$x \not\equiv \pm y \,\pmod$

From here we easily deduce
:$x^2 - y^2 \equiv 0 \pmod$
:$(x + y)(x - y) \equiv 0 \pmod$

This means that ''n'' divides the product (''x'' + ''y'')(''x'' − ''y''). Thus (''x'' + ''y'') and (''x'' − ''y'') each contain factors of ''n'', but those factors can be trivial. In this case we need to find another ''x'' and ''y''. Computing the greatest common divisors of (''x'' + ''y'', ''n'') and of (''x'' − ''y'', ''n'') will give us these factors; this can be done quickly using the Euclidean algorithm.

Congruences of squares are extremely useful in integer factorization algorithms and are extensively used in, for example, the quadratic sieve, general number field sieve, continued fraction factorization, and Dixon's factorization. Conversely, because finding square roots modulo a composite number turns out to be probabilistic polynomial-time equivalent to factoring that number, any integer factorization algorithm can be used efficiently to identify a congruence of squares.

Further generalizations

It is also possible to use factor bases to help find congruences of squares more quickly. Instead of looking for $\textstyle x^2 \equiv y^2 \pmod$ from the outset, we find many $\textstyle x^2 \equiv y \pmod$ where the ''y'' have small prime factors, and try to multiply a few of these together to get a square on the right-hand side.

Examples

Factorize 35

We take ''n'' = 35 and find that

:$\textstyle 6^2 = 36 \equiv 1 = 1^2 \pmod$.

We thus factor as

:$\gcd( 6-1, 35 ) \cdot \gcd( 6+1, 35 ) = 5 \cdot 7 = 35$

Factorize 1649

Using ''n'' = 1649, as an example of finding a congruence of squares built up from the products of non-squares (see Dixon's factorization method), first we obtain several congruences

:$41^2 \equiv 32 \pmod$
:$42^2 \equiv 115 \pmod$
:$43^2 \equiv 200 \pmod$

of these, two have only small primes as factors

:$32 = 2^5$
:$200 = 2^3 \cdot 5^2$

and a combination of these has an even power of each small prime, and is therefore a square

:$32 \cdot 200 = 2^ \cdot 5^2 = 2^8 \cdot 5^2 = (2^4 \cdot 5)^2 = 80^2$

yielding the congruence of squares

:$32 \cdot 200 = 80^2 \equiv 41^2 \cdot 43^2 \equiv 114^2 \pmod$

So using the values of 80 and 114 as our ''x'' and ''y'' gives factors

:$\gcd( 114-80, 1649 ) \cdot \gcd( 114+80, 1649 ) = 17 \cdot 97 = 1649.$

See also

*Congruence relation

{{DEFAULTSORT:Congruence Of Squares
Equivalence (mathematics)
Integer factorization algorithms
Modular arithmetic
Squares in number theory