Frobenius pseudoprime

From Wikipedia, the free encyclopedia

In number theory, a Frobenius pseudoprime is a pseudoprime that passes a specifi
c probable prime test described by Jon Grantham in a 1998 preprint and published
in 2000. [1] [2] It has been studied by other authors for the case of quadratic
polynomials. [3] [4]
Contents
1
2
3
4
5
6
7
8
9

Frobenius pseudoprimes w.r.t. quadratic polynomials

Example
Relations to other pseudoprimes
Alternate formulations
Strong Frobenius pseudoprimes
Properties
See also
References
External links

Frobenius pseudoprimes w.r.t. quadratic polynomials

Frobenius pseudoprimes are defined with respect to a fixed monic polynomial. The
case of a degree-2 (quadratic) polynomial \scriptstyle x^2 - Px + Q, where \scr
iptstyle D = P^2-4Q is not a square, is common and can be expressed in terms of
Lucas sequences U_n(P,Q) and V_n(P,Q), leading to fast implementations for testi
ng pseudoprimality.
A composite number n is a Frobenius (P,Q) pseudoprime if and only if \textstyle\
gcd(n,2QD)=1,
(1) \qquad U_{n-k}(P,Q) \equiv 0 \pmod n
and
(2) \qquad V_{n-k}(P,Q) \equiv \begin{cases}2Q\pmod n&\mbox{if }k=-1\\2\pmod
n&\mbox{if }k=1\mbox{,}\end{cases}
where \scriptstyle k=\left(\tfrac{D}{n}\right) is the Jacobi symbol.
Both conditions hold for all primes, hence this constitutes a probable prime tes
t.
Condition (1) is the same condition that defines a Lucas pseudoprime, hence ever
y Frobenius (P,Q) pseudoprime is also a Lucas (P,Q) pseudoprime, but because of
the additional condition (2), the converse is not true.
Example
Frobenius pseudoprimes with respect to the Fibonacci polynomial \scriptstyle x^2
-x-1 are determined in terms of the Fibonacci numbers F_n = U_n(1,-1) and Lucas
numbers L_n = V_n(1,-1). Such Frobenius pseudoprimes form the sequence:
4181, 5777, 6721, 10877, 13201, 15251, 34561, 51841,
251, 75077, 90061, 96049, 97921, 100127, 113573, 118441,
163081, 186961, 197209, 219781, 231703, 252601, 254321,
283361, 302101, 303101, 330929, 399001, 430127, 433621,
ce A212424 in OEIS).

64079, 64681, 67861, 68

146611, 161027, 162133,
257761, 268801, 272611,
438751, 489601,
(sequen

While 323 is the first Lucas pseudoprime with respect to the Fibonacci polynomia

l \scriptstyle x^2-x-1, the first Frobenius pseudoprime with respect to the same
polynomial is 4181 (Grantham indicates it is 5777[2] but multiple authors have
noted this is incorrect and is instead the first pseudoprime with \left(\tfrac{5
}{n}\right)=-1 for this polynomial[3]).
Another case, Frobenius pseudoprimes with respect to the quadratic polynomial \s
criptstyle x^2-3x-1 can be determined using the Lucas (3,-1) sequence and are:
119, 649, 1189, 4187, 12871, 14041, 16109, 23479, 24769, 28421, 31631, 34997
, 38503, 41441, 48577, 50545, 56279, 58081, 59081, 61447, 75077, 91187, 95761, 9
6139, 116821, 127937, 146329, 148943, 150281, 157693, 170039, 180517, 188501, 20
7761, 208349, 244649, 281017, 311579, 316409, 349441, 350173, 363091, 371399, 39
7927, 423721, 440833, 459191, 473801, 479119, 493697, .
In this case, the first Frobenius pseudoprime with respect to the quadratic poly
nomial \scriptstyle x^2-3x-1 is 119, which is also the first Lucas pseudoprime w
ith respect to the same polynomial. Besides, \left(\tfrac{13}{119}\right)=-1.
The quadratic polynomial \scriptstyle x^2-3x-5, with \scriptstyle (P,Q)=(3,-5),
has sparse pseudoprimes as compared to many other simple quadratics. Using the s
ame process as above, we get the sequence:
13333, 44801, 486157, 1615681, 3125281, 4219129, 9006401, 12589081, 13404751
, 15576571, 16719781, .
Notice there are only 3 such pseudoprimes below 500000, while there are many Fro
benius (1, -1) and (3, -1) pseudoprimes below 500000.
Every entry in this sequence is a Fermat pseudoprime to base 5 as well as a Luca
s (3,-5) pseudoprime, but the converse is not true: 642001 is both a psp-5 and a
Lucas (3,-5) pseudoprime, but is not a Frobenius (3,-5) pseudoprime.
Using parameter selection ideas first laid out in Baillie and Wagstaff (1980)[5]
as part of the Baillie-PSW primality test and used by Grantham in his quadratic
Frobenius test,[6] one can create even better quadratic tests. For instance, fo
r the parameters (P,2), where P is the first odd integer that satisfies \scripts
tyle\left(\tfrac{D}{n}\right) = -1, there are no pseudoprimes below \scriptstyle
2^{64}.
Relations to other pseudoprimes
For quadratic polynomials \scriptstyle x^2-Px+Q, every Frobenius (P,Q) pseudopri
me is also a Lucas (P,Q) pseudoprime. [2] [3] [7] This immediately follows from
condition (1) which defined a Lucas (P,Q) pseudoprime. The converse is not true,
making the Frobenius pseudoprimes a subset of the Lucas pseudoprimes for a give
n (P,Q). The condition on \scriptstyle V_k indicate it must also be a Dickson ps
eudoprime of the second kind.[7]
Every Frobenius pseudoprime to x^3-rx^2+sx-1 is also a Perrin pseudoprime.[2]
Alternate formulations
An alternate formulation is given by Khashin.[8] Given a number n, not a perfect
square, where c is the smallest odd prime with Jacobi symbol \left(\tfrac{c}{n}
\right)=-1, n is a either a prime or Frobenius pseudoprime if:
(1 + \sqrt{c})^n \equiv (1 - \sqrt{c}) \pmod n.
Note the additional condition of choosing a parameter based on the Jacobi symbol
finding a quadratic non-residue. This is similar to the method from Baillie and
Wagstaff shown in the examples section.[5] This makes far stronger tests, and i
s one reason for the success of the Baillie-PSW primality test. Similar to the e

xample, Khashin notes that no pseudoprime has been found for his test. He furthe
r shows that any that exist under 260 must have a factor less than 19 or have c
> 128.
Strong Frobenius pseudoprimes
Strong Frobenius pseudoprimes are also defined.[2] Details on implementation for
quadratic polynomials can be found in Crandall and Pomerance.[3]
Properties
The computational cost of the Frobenius pseudoprimality test with respect to qua
dratic polynomials is roughly three times the cost of a strong pseudoprimality t
est (e.g. a single round of the Miller-Rabin primality test), 1.5 times that of
a Lucas pseudoprimality test, and slightly more than a Baillie-PSW primality tes
t.
Note that the quadratic Frobenius test is stronger than the Lucas test. For exam
ple, 1763 is a Lucas pseudoprime to (P, Q) = (3, -1) since U1764(3,-1) = 0 (mod
1763) (U(3,-1) is given in OEIS?A006190), and it also passes the Jacobi step sin
ce \left(\tfrac{13}{1763}\right) = -1, but it fails the Frobenius test to x2 - 3
x - 1. This property can be clearly seen when the algorithm is formulated as sho
wn in Crandall and Pomerance Algorithm 3.6.9[3] or as shown by Loebenberger,[4]
as the algorithm does a Lucas test followed by an additional check for the Frobe
nius condition.
While the quadratic Frobenius test does not have formal error bounds beyond that
of the Lucas test, it can be used as the basis for methods with much smaller er
ror bounds. Note that these have more steps, additional requirements, and non-ne
gligible additional computation beyond what is described on this page. It is imp
ortant to note that the error bounds for these methods do not apply to the stand
ard or strong Frobenius tests with fixed values of (P,Q) described on this page.
Based on this idea of pseudoprimes, algorithms with strong worst-case error boun
ds can be built. The quadratic Frobenius test,[6] using a quadratic Frobenius te
st plus other conditions, has a bound of \tfrac{1}{7710}. Mller in 2001 proposed
the MQFT test with bounds of essentially \tfrac{1}{131040^t}. [9] Damgrd and Fran
dsen in 2003 proposed the EQFT with a bound of essentially \tfrac{256}{{331776}^
t}. [10] Seysen in 2005 proposed the SQFT test with a bound of \tfrac{1}{{4096}^
t} and a SQFT3 test with a bound of \tfrac{16}{336442^t}. [11]
Given the same computational effort, these offer better worst-case bounds than t
he commonly used Miller-Rabin primality test.
See also
Pseudoprime
Lucas pseudoprime
Ferdinand Georg Frobenius
Quadratic Frobenius test
References
Jon Grantham (1998). Frobenius pseudoprimes (Report). preprint.
Jon Grantham (2001). "Frobenius pseudoprimes". Mathematics of Computation 70 (23
4): 873 891. doi:10.1090/S0025-5718-00-01197-2.
Richard Crandall; Carl Pomerance (2005). Prime numbers: A computational perspect
ive (2nd ed.). Springer-Verlag. ISBN 0-387-25282-7.
Daniel Loebenberger (2008). "A Simple Derivation for the Frobenius Pseudoprime T
est" (PDF). IACR Cryptology ePrint Archive 2008.
Robert Baillie; Samuel S. Wagstaff, Jr. (October 1980). "Lucas Pseudoprimes" (PD
F). Mathematics of Computation 35 (152): 1391 1417. doi:10.1090/S0025-5718-1980-05
83518-6. MR 583518. Cite uses deprecated parameter |coauthors= (help)

Jon Grantham (1998). "A Probable Prime Test With High Confidence". Journal of Nu
mber Theory (Academic Press) 72 (1): 32 47. doi:10.1006/jnth.1998.2247.
Andrzej Rotkiewicz (2003). "Lucas and Frobenius pseudoprimes" (PDF). Annales Mat
hematicae Silesianae (Wydawnictwo Uniwersytetu Slaskiego) 17: 17 39.
Khashin, Sergey (July 2013). "Counterexamples for Frobenius primality test". arX
iv:1307.7920 [math.NT].
Siguna Mller (2001). "A Probable Prime Test with Very High Confidence for N Equiv
1 Mod 4". Proceedings of the 7th International Conference on the Theory and App
lication of Cryptology and Information Security: Advances in Cryptology. ASIACRY
PT. pp. 87 106. doi:10.1007/3-540-45682-1_6. ISBN 3-540-42987-5.
Ivan Bjerre Damgrd; Gudmund Skovbjerg Frandsen (October 2006). "An Extended Quadr
atic Frobenius Primality Test with Average- and Worst-Case Error Estimate" (PDF)
. Journal of Cryptology 19 (4): 489 520. doi:10.1007/s00145-006-0332-x.
Martin Seysen. A Simplified Quadratic Frobenius Primality Test, 2005.
External links
Weisstein, Eric W., "Frobenius Pseudoprime", MathWorld.
Weisstein, Eric W., "Strong Frobenius Pseudoprime", MathWorld.
Jacobsen, Dana Pseudoprime Statistics, Tables, and Data (data for Frobenius
(1,-1) and (3,-5) pseudoprimes)
[show]
v t e
Classes of natural numbers
Categories:
Pseudoprimes
Navigation menu
Not logged in
Talk
Contributions
Create account
Log in
Article
Talk
Read
Edit
View history
Main page
Contents
Featured content
Current events
Random article
Donate to Wikipedia
Wikipedia store
Interaction
Help
About Wikipedia
Community portal

Recent changes
Contact page
Tools
What links here
Related changes
Upload file
Special pages
Permanent link
Page information
Wikidata item
Cite this page
Print/export
Create a book
Download as PDF
Printable version
Languages
???????
Edit links
This page was last modified on 28 September 2015, at 15:13.
Text is available under the Creative Commons Attribution-ShareAlike License;
additional terms may apply. By using this site, you agree to the Terms of Use a
nd Privacy Policy. Wikipedia is a registered trademark of the Wikimedia Foundatio
n, Inc., a non-profit organization.
Privacy policy
About Wikipedia
Disclaimers
Contact Wikipedia
Developers
Cookie statement
Mobile view
Wikimedia Foundation
Powered by MediaWiki