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

DOI10.1090/S0025-5718-02-01424-2zbMATH Open1076.11063MaRDI QIDQ3147182FDOQ3147182

Authors: Zhenxiang Zhang 

Publication date: 18 September 2002

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

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

zbMATH Keywords

finite groupsprobability of errorquadratic integersLucas testRabin-Miller testBaillie-PSW probable prime testbase-counting functionsChinese Remainder Theorem.strong Lucas pseudoprimes

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Probabilistic algorithm for testing primality
• Riemann's hypothesis and tests for primality
• There are infinitely many Carmichael numbers
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Numbers Analogous to the Carmichael Numbers
• Title not available (Why is that?)
• The Carmichael Numbers up to 10 15
• The Pseudoprimes to 25 ⋅10 9
• Lucas Pseudoprimes
• Primality Testing and Jacobi Sums
• Title not available (Why is that?)
• Implementation of a new primality test
• Evaluation and comparison of two efficient probabilistic primality testing algorithms
• Finding strong pseudoprimes to several bases
• Frobenius pseudoprimes
• A probable prime test with high confidence
• The Rabin-Monier theorem for Lucas pseudoprimes
• Title not available (Why is that?)
• Using Lucas sequences to factor large integers near group orders.

Cited In (9)

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

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)