The quadratic Frobenius test (QFT) is a probabilistic primality test to determine whether a number is a probable prime. It is named after Ferdinand Georg Frobenius. The test uses the concepts of quadratic polynomials and the Frobenius automorphism. It should not be confused with the more general Frobenius test using a quadratic polynomial – the QFT restricts the polynomials allowed based on the input, and also has other conditions that must be met. A composite passing this test is a Frobenius pseudoprime, but the converse is not necessarily true.
Concept Grantham's stated goal when developing the algorithm was to provide a test that primes would always pass and composites would pass with a probability of less than 1/7710. The test was later extended by Damgård and Frandsen to a test called extended quadratic Frobenius test (EQFT).
Algorithm Let n be a positive integer such that n is odd, and let b and c be integers such that ( b 2 + 4 c n ) = − 1 {\displaystyle \left({\frac {b^{2}+4c}{n}}\right)=-1} and ( − c n ) = 1 {\displaystyle \left({\frac {-c}{n}}\right)=1} , where ( ⋅ ⋅ ) {\displaystyle \left({\frac {\cdot }{\cdot }}\right)} denotes the Jacobi symbol. Set B = 50000 {\displaystyle B=50000} . Then a QFT on n with parameters (b, c) works as follows:
(1) Test whether any of the primes less than or equal to min ( B , n ) {\displaystyle \min(B,{\sqrt {n}})} divides n. If yes, then stop: n is composite. (2) Test whether n ∈ Z {\displaystyle {\sqrt {n}}\in \mathbb {Z} } . If yes, then stop: n is composite. (3) Compute x n + 1 2 mod ( n , x 2 − b x − c ) {\displaystyle x^{n+1 \over 2}\,{\bmod {\,}}{\big (}n,x^{2}-bx-c)} . If x n + 1 2 ∉ Z / n Z {\displaystyle x^{n+1 \over 2}\notin \mathbb {Z} {\big /}n\mathbb {Z} } , then stop: n is composite. (4) Compute x n + 1 mod ( n , x 2 − b x − c ) {\displaystyle x^{n+1}\,{\bmod {\,}}{\big (}n,x^{2}-bx-c)} . If x n + 1 ≢ − c {\displaystyle x^{n+1}\not \equiv -c} , then stop: n is composite. (5) Let n 2 − 1 = 2 r s {\displaystyle n^{2}-1=2^{r}s} with s odd. If x s ≢ 1 mod ( n , x 2 − b x − c ) {\displaystyle x^{s}\not \equiv 1{\bmod {\,}}{\big (}n,x^{2}-bx-c)} , and x 2 j s ≢ − 1 mod ( n , x 2 − b x − c ) {\displaystyle x^{2^{j}s}\not \equiv -1{\bmod {\,}}{\big (}n,x^{2}-bx-c)} for all 0 ≤ j ≤ r − 2 {\displaystyle 0\leq j\leq r-2} , then stop: n is composite. If the QFT does not stop in steps (1)–(5), then n is a probable prime. (The notation A ≡ B mod ( n , f ( x ) ) {\displaystyle A\equiv B{\bmod {\,}}(n,\,f(x))} means that A − B = H ( x ) ⋅ n + K ( x ) ⋅ f ( x ) {\displaystyle A-B=H(x)\cdot n+K(x)\cdot f(x)} , where H and K are polynomials.)
See also Integers modulo n Multiplicative group of integers modulo n
References
