A one-parameter quadratic-base version of the Baillie-PSW probable prime test

DOI10.1090/S0025-5718-02-01424-2zbMath1076.11063MaRDI QIDQ3147182

Zhenxiang Zhang

Publication date: 18 September 2002

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

finite groupsstrong Lucas pseudoprimesprobability of errorquadratic integersLucas testRabin-Miller testBaillie-PSW probable prime testbase-counting functionsChinese Remainder Theorem.

Mathematics Subject Classification ID

Quadratic extensions (11R11) Factorization; primality (11A51) Primality (11Y11)

Related Items (5)

Notes on some new kinds of pseudoprimes ⋮ On the effectiveness of a generalization of Miller's primality theorem ⋮ Finding strong pseudoprimes to several bases. II ⋮ An unconditional improvement to the running time of the quadratic Frobenius test ⋮ Estimating the counts of Carmichael and Williams numbers with small multiple seeds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic algorithm for testing primality
• Evaluation and comparison of two efficient probabilistic primality testing algorithms
• Riemann's hypothesis and tests for primality
• A probable prime test with high confidence
• There are infinitely many Carmichael numbers
• Finding strong pseudoprimes to several bases
• Frobenius pseudoprimes
• The Rabin-Monier theorem for Lucas pseudoprimes
• The Carmichael Numbers up to 10 15
• Primality Testing and Jacobi Sums
• Implementation of a new primality test
• The Pseudoprimes to 25 ⋅10 9
• Lucas Pseudoprimes
• On Numbers Analogous to the Carmichael Numbers

This page was built for publication: A one-parameter quadratic-base version of the Baillie-PSW probable prime test