This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details.(August 2021) (Learn how and when to remove this message)
In number theory, a Frobenius pseudoprime is a pseudoprime, whose definition was inspired by the quadratic Frobenius test described by Jon Grantham in a 1998 preprint and published in 2000.[1][2] Frobenius pseudoprimes can be defined with respect to polynomials of degree at least 2, but they have been most extensively studied in the case of quadratic polynomials.[3][4]
^Grantham, Jon (1998). Frobenius pseudoprimes (Report). preprint.
^Grantham, Jon (2001). "Frobenius pseudoprimes". Mathematics of Computation. 70 (234): 873–891. arXiv:1903.06820. Bibcode:2001MaCom..70..873G. doi:10.1090/S0025-5718-00-01197-2.
^Crandall, Richard; Pomerance, Carl (2005). Prime numbers: A computational perspective (2nd ed.). Springer-Verlag. ISBN 978-0-387-25282-7.
^Loebenberger, Daniel (2008). "A Simple Derivation for the Frobenius Pseudoprime Test" (PDF). IACR Cryptology ePrint Archive. 2008.
and 28 Related for: Frobenius pseudoprime information
In number theory, a Frobeniuspseudoprime is a pseudoprime, whose definition was inspired by the quadratic Frobenius test described by Jon Grantham in...
congruences defining a Frobeniuspseudoprime. Hence, every Frobeniuspseudoprime is also a Baillie-Wagstaff-Lucas pseudoprime, but the converse does not...
However, no Carmichael number is either an Euler–Jacobi pseudoprime or a strong pseudoprime to every base relatively prime to it so, in theory, either...
Frobenius test (QFT) is a probabilistic primality test to determine whether a number is a probable prime. It is named after Ferdinand Georg Frobenius...
In number theory, a pseudoprime is called an elliptic pseudoprime for (E, P), where E is an elliptic curve defined over the field of rational numbers...
If n is composite and satisfies the formula, then n is a Fibonacci pseudoprime. When m is large – say a 500-bit number – then we can calculate Fm (mod...
In number theory, the Fermat pseudoprimes make up the most important class of pseudoprimes that come from Fermat's little theorem. Fermat's little theorem...
certainly composite. A composite number that passes such a test is called a pseudoprime. In contrast, some other algorithms guarantee that their answer will...
In mathematics, a Catalan pseudoprime is an odd composite number n satisfying the congruence ( − 1 ) n − 1 2 ⋅ C n − 1 2 ≡ 2 ( mod n ) , {\displaystyle...
composites also pass, making them "pseudoprimes". Unlike the Fermat pseudoprimes, for which there exist numbers that are pseudoprimes to all coprime bases (the...
In arithmetic, an odd composite integer n is called an Euler pseudoprime to base a, if a and n are coprime, and a ( n − 1 ) / 2 ≡ ± 1 ( mod n ) {\displaystyle...
restricted Perrin pseudoprimes. There are only nine such numbers below 109. While Perrin pseudoprimes are rare, they overlap with Fermat pseudoprimes. Of the above...
{\displaystyle \mathbb {F} _{q},} and is a field automorphism, called the Frobenius automorphism. If q = p k , {\displaystyle q=p^{k},} the field F q {\displaystyle...
Fermat number is a strong pseudoprime to base 2. This is because all strong pseudoprimes to base 2 are also Fermat pseudoprimes – i.e., 2 F n − 1 ≡ 1 (...
n {\displaystyle n} also have this property. These are the Fibonacci pseudoprimes. L n − L n − 4 {\displaystyle L_{n}-L_{n-4}} is congruent to 0 modulo...
Global Information