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

DOI10.1090/S0025-5718-02-01424-2MaRDI QIDQ3147182zbMATH OpenFDO

Authors Zhenxiang Zhang

Publication date 18 September 2002

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

Full work available at URL https://doi.org/10.1090/S0025-5718-02-01424-2

zbMATH Keywords

Baillie-PSW probable prime testbase-counting functionsChinese Remainder Theorem.finite groupsLucas testprobability of errorquadratic integersRabin-Miller teststrong Lucas pseudoprimes

Mathematics Subject Classification ID

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

Recommendations

• An extended quadratic Frobenius primality test with average- and worst-case error estimate
• A probable prime test with high confidence
• Strengthening the Baillie-PSW primality test
• An extended quadratic Frobenius primality test with average and worst case error estimates.
• scientific article; zbMATH DE number 1643943

Cites work

• A probable prime test with high confidence
• Evaluation and comparison of two efficient probabilistic primality testing algorithms
• Finding strong pseudoprimes to several bases
• Frobenius pseudoprimes
• scientific article; zbMATH DE number 435565 (Why is no real title available?)
• scientific article; zbMATH DE number 3869411 (Why is no real title available?)
• scientific article; zbMATH DE number 3750146 (Why is no real title available?)
• scientific article; zbMATH DE number 3758416 (Why is no real title available?)
• scientific article; zbMATH DE number 44444 (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?)
• Implementation of a new primality test
• Lucas Pseudoprimes
• On Numbers Analogous to the Carmichael Numbers
• Primality Testing and Jacobi Sums
• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality
• The Carmichael Numbers up to 10 15
• The Pseudoprimes to 25 ⋅10 9
• The Rabin-Monier theorem for Lucas pseudoprimes
• There are infinitely many Carmichael numbers
• Using Lucas sequences to factor large integers near group orders.

Cited in

(9)

• Strong pseudoprimes to base 2
• An unconditional improvement to the running time of the quadratic Frobenius test
• Strong pseudoprimes to twelve prime bases
• Improved error bounds for the Fermat primality test on random inputs
• Finding strong pseudoprimes to several bases. II
• Estimating the counts of Carmichael and Williams numbers with small multiple seeds
• scientific article; zbMATH DE number 2219835 (Why is no real title available?)
• Notes on some new kinds of pseudoprimes
• On the effectiveness of a generalization of Miller's primality theorem

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

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