Strong pseudoprimes to twelve prime bases
From MaRDI portal
Publication:2953216
DOI10.1090/mcom/3134zbMath1370.11140arXiv1509.00864OpenAlexW1812494664MaRDI QIDQ2953216
Jonathan Webster, Jonathan P. Sorenson
Publication date: 4 January 2017
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.00864
Analysis of algorithms (68W40) Number-theoretic algorithms; complexity (11Y16) Parallel algorithms in computer science (68W10) Primes (11A41) Primality (11Y11)
Related Items (6)
On a modification of the Lucas primality test ⋮ Fast tabulation of challenge pseudoprimes ⋮ Computing Elliptic Curves over $$\mathbb{Q}$$ : Bad Reduction at One Prime ⋮ Computing elliptic curves over $\mathbb {Q}$ ⋮ The error probability of the Miller-Rabin primality test ⋮ Two algorithms to find primes in patterns
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic algorithm for testing primality
- An upper bound for the g.c.d. of \(a^n-1\) and \(b^n -1\)
- On the order of finitely generated subgroups of \(\mathbb{Q}^*\pmod p\) and divisors of \(p-1\)
- A note on Mertens' formula for arithmetic progressions
- Fast multiplication of large numbers
- On the 𝑟-rank Artin Conjecture
- Strong pseudoprimes to the first eight prime bases
- Explicit Bounds for Primality Testing and Related Problems
- Two kinds of strong pseudoprimes up to $10^{36}$
- The Pseudoprimes to 25 ⋅10 9
- On Strong Pseudoprimes to Several Bases
- Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures
- Algorithmic Number Theory
- Algorithmic Number Theory
- On the Brun-Titchmarsh theorem
This page was built for publication: Strong pseudoprimes to twelve prime bases
