An unconditional improvement to the running time of the quadratic Frobenius test
From MaRDI portal
Publication:2291718
DOI10.1016/j.jnt.2019.10.006zbMath1465.11234arXiv1908.02394OpenAlexW2990800671MaRDI QIDQ2291718
Publication date: 31 January 2020
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.02394
Cites Work
- Unnamed Item
- Unnamed Item
- Large character sums: Burgess's theorem and zeros of \(L\)-functions
- An extended quadratic Frobenius primality test with average- and worst-case error estimate
- Probabilistic algorithm for testing primality
- Evaluation and comparison of two efficient probabilistic primality testing algorithms
- A probable prime test with high confidence
- A probable prime test with very high confidence for \(n \equiv 3\mod4\)
- Frobenius pseudoprimes
- A one-parameter quadratic-base version of the Baillie-PSW probable prime test
- The Character Sum Estimate with r = 3
- The Pseudoprimes to 25 ⋅10 9
- Lucas Pseudoprimes
- Density of non-residues in Burgess-type intervals and applications
This page was built for publication: An unconditional improvement to the running time of the quadratic Frobenius test