Editing Primality test (section)

=== Frobenius primality test ===
The Miller–Rabin and the Solovay–Strassen primality tests are simple and are much faster than other general primality tests. One method of improving efficiency further in some cases is the [[Frobenius pseudoprime|Frobenius pseudoprimality test]]; a round of this test takes about three times as long as a round of Miller–Rabin, but achieves a probability bound comparable to seven rounds of Miller–Rabin.

The Frobenius test is a generalization of the [[Lucas pseudoprime|Lucas probable prime]] test.