Proving primality in essentially quartic random time
From MaRDI portal
Publication:3420438
DOI10.1090/S0025-5718-06-01786-8zbMath1144.11085MaRDI QIDQ3420438
Publication date: 2 February 2007
Published in: Mathematics of Computation (Search for Journal in Brave)
Related Items (11)
Sharper \(ABC\)-based bounds for congruent polynomials ⋮ It is easy to determine whether a given integer is prime ⋮ Lower bounds on the orders of subgroups connected with Agrawal conjecture ⋮ On the distribution of Atkin and Elkies primes ⋮ Primality testing with Gaussian periods ⋮ A faster pseudo-primality test ⋮ Elliptic periods and primality proving ⋮ There are infinitely many Perrin pseudoprimes ⋮ Sieving for Pseudosquares and Pseudocubes in Parallel Using Doubly-Focused Enumeration and Wheel Datastructures ⋮ Efficient CM-constructions of elliptic curves over finite fields ⋮ On the construction of finite field elements of large order
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On some subgroups of the multiplicative group of finite rings
- On distinguishing prime numbers from composite numbers
- Sharper \(ABC\)-based bounds for congruent polynomials
- Primality testing and Abelian varieties over finite fields
- Self-witnessing polynomial-time complexity and prime factorization
- PRIMES is in P
- Orders and their applications. Proceedings of a Conference held in Oberwolfach, West Germany, June 3-9, 1984
- The mathematics of Paul Erdős. Vol. I
- Primality testing using elliptic curves
- Detecting perfect powers by factoring into coprimes
- Finding Suitable Curves for the Elliptic Curve Method of Factorization
- Detecting perfect powers in essentially linear time
- Advances in Cryptology – CRYPTO 2004
- Sharpening ``Primes is in P for a large family of numbers
- Advances in Cryptology - CRYPTO 2003
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
This page was built for publication: Proving primality in essentially quartic random time
