Sharpening ``Primes is in P for a large family of numbers
From MaRDI portal
Publication:5315434
DOI10.1090/S0025-5718-05-01727-8zbMath1071.11071arXivmath/0211334MaRDI QIDQ5315434
Publication date: 8 September 2005
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0211334
Related Items
It is easy to determine whether a given integer is prime, On the construction of finite field elements of large order, Proving primality in essentially quartic random time, Implementing the asymptotically fast version of the elliptic curve primality proving algorithm, A generalization of Miller’s primality theorem
Cites Work
- On distinguishing prime numbers from composite numbers
- Primality testing and Abelian varieties over finite fields
- PRIMES is in P
- Divisors in Residue Classes
- Primality Testing and Jacobi Sums
- A generalization of Proth's theorem
- Biquadratic reciprocity and a Lucasian primality test
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item