A probable prime test with high confidence
From MaRDI portal
Publication:1273196
DOI10.1006/JNTH.1998.2247zbMath0930.11087arXiv1903.06823OpenAlexW2031341025WikidataQ56673772 ScholiaQ56673772MaRDI QIDQ1273196
Publication date: 16 February 2000
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.06823
Related Items (6)
A generalization of Miller’s primality theorem ⋮ Frobenius pseudoprimes ⋮ On the existence and non-existence of elliptic pseudoprimes ⋮ An unconditional improvement to the running time of the quadratic Frobenius test ⋮ Strengthening the Baillie-PSW primality test ⋮ A one-parameter quadratic-base version of the Baillie-PSW probable prime test
Cites Work
- The generation of random numbers that are probably prime
- Probabilistic algorithm for testing primality
- Evaluation and comparison of two efficient probabilistic primality testing algorithms
- Frobenius pseudoprimes
- The Rabin-Monier theorem for Lucas pseudoprimes
- The Pseudoprimes to 25 ⋅10 9
- Strong Primality Tests that are Not Sufficient
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A probable prime test with high confidence