Proving primality in essentially quartic random time
From MaRDI portal
Recommendations
Cites work
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- Detecting perfect powers by factoring into coprimes
- Detecting perfect powers in essentially linear time
- Finding Suitable Curves for the Elliptic Curve Method of Factorization
- scientific article; zbMATH DE number 981695 (Why is no real title available?)
- scientific article; zbMATH DE number 4070827 (Why is no real title available?)
- scientific article; zbMATH DE number 47903 (Why is no real title available?)
- scientific article; zbMATH DE number 1142300 (Why is no real title available?)
- On distinguishing prime numbers from composite numbers
- On some subgroups of the multiplicative group of finite rings
- On the List and Bounded Distance Decodability of Reed–Solomon Codes
- Orders and their applications. Proceedings of a Conference held in Oberwolfach, West Germany, June 3-9, 1984
- Primality testing and Abelian varieties over finite fields
- Primality testing using elliptic curves
- PRIMES is in P
- Self-witnessing polynomial-time complexity and prime factorization
- Sharpening ``Primes is in P for a large family of numbers
- Sharper ABC-based bounds for congruent polynomials
- The mathematics of Paul Erdős. Vol. I
Cited in
(24)- Primality testing with Gaussian periods
- A faster pseudo-primality test
- Elliptic periods and primality proving
- An unconditional improvement to the running time of the quadratic Frobenius test
- On the construction of finite field elements of large order
- scientific article; zbMATH DE number 981695 (Why is no real title available?)
- Lower bounds on the orders of subgroups connected with Agrawal conjecture
- Efficient CM-constructions of elliptic curves over finite fields
- An $O(n^{1/10.89))$ Primality Testing Algorithm,$
- On the distribution of Atkin and Elkies primes
- A note on monte carlo primality tests and algorithmic information theory
- It is easy to determine whether a given integer is prime
- Sieving for pseudosquares and pseudocubes in parallel using doubly-focused enumeration and wheel datastructures
- Implementations of the improved AKS primality testing algorithm
- scientific article; zbMATH DE number 7556735 (Why is no real title available?)
- Sharpening ``Primes is in P for a large family of numbers
- Advances in Cryptology - CRYPTO 2003
- The Lucas-Pratt primality tree
- Analyzing the AKS algorithm and its improved algorithm in detail
- FastECPP over MPI
- An algorithm and computation to verify Legendre's conjecture up to \(7\cdot 10^{13}\)
- Sharper ABC-based bounds for congruent polynomials
- On the effectiveness of a generalization of Miller's primality theorem
- There are infinitely many Perrin pseudoprimes
This page was built for publication: Proving primality in essentially quartic random time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3420438)
