Strengthening the Baillie-PSW primality test
From MaRDI portal
Publication:4992237
DOI10.1090/mcom/3616zbMath1478.11152arXiv2006.14425OpenAlexW3037248523MaRDI QIDQ4992237
Andrew Fiori, Robert Baillie, Samuel S. jun. Wagstaff
Publication date: 7 June 2021
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2006.14425
Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Factorization; primality (11A51) Primality (11Y11)
Related Items (3)
An intelligent choice of witnesses in the Miller-Rabin primality test. Reinforcement learning approach ⋮ Unnamed Item ⋮ Strengthening the Baillie-PSW primality test
Cites Work
- 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
- A new lower bound for the pseudoprime counting function
- A probable prime test with high confidence
- There are infinitely many Carmichael numbers
- Frobenius pseudoprimes
- Infinitely many Carmichael numbers in arithmetic progressions
- The Rabin-Monier theorem for Lucas pseudoprimes
- The Carmichael Numbers up to 10 15
- The Pseudoprimes to 25 ⋅10 9
- Lucas Pseudoprimes
- New Primality Criteria and Factorizations of 2 m ± 1
- On Numbers Analogous to the Carmichael Numbers
- Strengthening the Baillie-PSW primality test
- Average liar count for degree-$2$ Frobenius pseudoprimes
This page was built for publication: Strengthening the Baillie-PSW primality test
