 | This article may be too technical for most readers to understand. (August 2021) |
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.