It is easy to determine whether a given integer is prime (2005)

by Andrew Granville
Venue:Bulletin of the American Mathematical Society
Citations:12 - 1 self

Active Bibliography

6 It Is Easy to Determine Whether a Given Integer Is – Andrew Granville - 2005
26 PRIMES is in P – Manindra Agrawal, Neeraj Kayal, Nitin Saxena - 2002
2 Cyclotomy primality proofs and their certificates. Mathematica Goettingensis – Preda Mihăilescu - 2006
21 Smooth numbers: computational number theory and beyond – Andrew Granville - 2008
Modern Primality Tests and the Agrawal-Kayal-Saxena Algorithm – Jason Wojciechowski - 2003
3 Primality testing – Richard P - 1992
Primality testing – Richard P. Brent - 2003
Fast Primality Proving on Cullen Numbers – Tsz-wo Sze - 2009
18 Proving primality in essentially quartic random time – Daniel J. Bernstein - 2003
5 Primality proving via one round in ECPP and one iteration in AKS – Qi Cheng - 2003
3 Four primality testing algorithms – René Schoof - 2008
unknown title – unknown authors - 2004
Uncertainty can be Better than Certainty: Some Algorithms for Primality Testing ∗ – Richard P. Brent - 2006
21 Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters – Ueli M. Maurer - 1995
9 Implementation Of The Atkin-Goldwasser-Kilian Primality Testing Algorithm – François Morain - 1988
1 Computational Methods in Public Key Cryptology – Arjen K. Lenstra - 2002
5 On values taken by the largest prime factor of shifted primes – William D. Banks, Igor E. Shparlinski
22 Primality testing using elliptic curves – Shafi Goldwasser, Joe Kilian - 1999
Abstract Uncertainty can be Better than Certainty: Some Algorithms for Primality Testing ∗ – Richard P. Brent