Frobenius pseudoprimes
From MaRDI portal
Abstract: The proliferation of probable prime tests in recent years has produced a plethora of definitions with the word ``pseudoprime in them. Examples include pseudoprimes, Euler pseudoprimes, strong pseudoprimes, Lucas pseudoprimes, strong Lucas pseudoprimes, extra strong Lucas pseudoprimes and Perrin pseudoprimes. Though these tests represent a wealth of ideas, they exist as a hodge-podge of definitions rather than as examples of a more general theory. It is the goal of this paper to present a way of viewing many of these tests as special cases of a general principle, as well as to re-formulate them in the context of finite fields. One aim of the reformulation is to enable the creations of stronger tests; another is to aid in proving results about large classes of pseudoprimes.
Recommendations
- scientific article; zbMATH DE number 7646866
- scientific article; zbMATH DE number 5010876
- Pseudo Frobenius numbers
- Frobenius pseudoprimes and a cubic primality test
- scientific article; zbMATH DE number 4125464
- scientific article; zbMATH DE number 3208353
- scientific article; zbMATH DE number 3977075
- scientific article; zbMATH DE number 4120236
Cites work
- A Note on Perrin Pseudoprimes
- A probable prime test with high confidence
- Characterizing Pseudoprimes for Third-Order Linear Recurrences
- Evaluation and comparison of two efficient probabilistic primality testing algorithms
- Fast Primality Tests for Numbers Less Than 50 ⋅10 9
- Frobenius pseudoprimes
- scientific article; zbMATH DE number 3887879 (Why is no real title available?)
- scientific article; zbMATH DE number 1210365 (Why is no real title available?)
- scientific article; zbMATH DE number 683826 (Why is no real title available?)
- scientific article; zbMATH DE number 3799728 (Why is no real title available?)
- scientific article; zbMATH DE number 799757 (Why is no real title available?)
- scientific article; zbMATH DE number 878900 (Why is no real title available?)
- scientific article; zbMATH DE number 3394226 (Why is no real title available?)
- Lucas Pseudoprimes
- On Euler Lehmer Pseudoprimes and Strong Lehmer Pseudoprimes with Parameters L, Q in Arithmetic Progressions
- On the Distribution of Pseudoprimes
- Probabilistic algorithm for testing primality
- Pseudoprimes for Higher-Order Linear Recurrence Sequences
- Strong Primality Tests that are Not Sufficient
- The Converse of Fermat's Theorem
- The Distribution of Lucas and Elliptic Pseudoprimes
- The Pseudoprimes to 25 ⋅10 9
- There are infinitely many Carmichael numbers
- There are infinitely many Perrin pseudoprimes
Cited in
(24)- A probable prime test with high confidence
- Weak pseudoprimality associated with the generalized Lucas sequences
- Pseudoprimality related to the generalized Lucas sequences
- An unconditional improvement to the running time of the quadratic Frobenius test
- Pseudoprime values of the Fibonacci sequence, polynomials and the Euler function
- Frobenius pseudoprimes
- Some remarks on Lucas pseudoprimes
- A one-parameter quadratic-base version of the Baillie-PSW probable prime test
- Frobenius pseudoprimes and a cubic primality test
- scientific article; zbMATH DE number 5010876 (Why is no real title available?)
- Proof of two conjectures of Andrica and Bagdasar
- On the existence and non-existence of elliptic pseudoprimes
- Higher-order Carmichael numbers
- Primality Tests Using Algebraic Groups
- Strengthening the Baillie-PSW primality test
- Average liar count for degree-2 Frobenius pseudoprimes
- Quadratic Frobenius pseudoprimes with respect to x^2+5x+5
- scientific article; zbMATH DE number 7646866 (Why is no real title available?)
- On a modification of the Lucas primality test
- Fast tabulation of challenge pseudoprimes
- Lots and lots of Perrin-type primality tests and their pseudo-primes
- Bad witnesses for a composite number
- On some links between the generalised Lucas pseudoprimes of level k
- There are infinitely many Perrin pseudoprimes
This page was built for publication: Frobenius pseudoprimes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2701573)