Strong Primality Tests that are Not Sufficient

DOI10.2307/2007637MaRDI QIDQ3953832zbMATH OpenOpenAlexFDO

Authors William W. Adams, Daniel Shanks

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

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

Cited in

(20)

• A nonlinear public key cryptosystem
• A probable prime test with high confidence
• Recent developments in primality proving
• SumCracker: A package for manipulating symbolic sums and related objects
• Association of multiple zeta values with positive knots via Feynman diagrams up to 9 loops
• Frobenius pseudoprimes
• On the Number of Elliptic Pseudoprimes
• scientific article; zbMATH DE number 166930 (Why is no real title available?)
• scientific article; zbMATH DE number 1154147 (Why is no real title available?)
• A cubic analogue of the RSA cryptosystem
• Higher-order Carmichael numbers
• How strong can primes be
• Linear recurrence sequences satisfying congruence conditions
• The multiple zeta value data mine
• Padovan and Perrin Identities by Rectangular Tilings
• Lots and lots of Perrin-type primality tests and their pseudo-primes
• On a model of \(([k];p;s)\)-generalized Padovan-Perrin and Fibonacci fundamental system
• Some Results Concerning the Padovan Numbers
• Power integral bases for Selmer-like number fields
• There are infinitely many Perrin pseudoprimes

This page was built for publication: Strong Primality Tests that are Not Sufficient

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3953832)