Strong Primality Tests that are Not Sufficient

DOI10.2307/2007637zbMath0492.10005OpenAlexW4252024686MaRDI QIDQ3953832

Daniel Shanks, William W. Adams

Publication date: 1982

Full work available at URL: https://doi.org/10.2307/2007637

zbMATH Keywords

primality testspseudoprimesthird-order recurrence relation

Mathematics Subject Classification ID

Recurrences (11B37) Factorization; primality (11A51) Primality (11Y11)

Related Items

Unnamed Item, A nonlinear public key cryptosystem, Power integral bases for Selmer-like number fields, The multiple zeta value data mine, Frobenius pseudoprimes, SumCracker: A package for manipulating symbolic sums and related objects, Linear recurrence sequences satisfying congruence conditions, There are infinitely many Perrin pseudoprimes, A probable prime test with high confidence, A cubic analogue of the RSA cryptosystem, Unnamed Item, Association of multiple zeta values with positive knots via Feynman diagrams up to 9 loops, On the Number of Elliptic Pseudoprimes, Recent developments in primality proving, Higher-order Carmichael numbers