Proving primality in essentially quartic random time (2003)

by Daniel J. Bernstein
Venue:Math. Comp
Citations:18 - 0 self

Active Bibliography

7 Proving Primality In Essentially Quartic Expected Time – Daniel J. Bernstein - 2003
2 Cyclotomy primality proofs and their certificates. Mathematica Goettingensis – Preda Mihăilescu - 2006
ELLIPTIC PERIODS AND PRIMALITY PROVING (EXTENTED VERSION) – Jean-marc Couveignes, Tony Ezome, Reynald Lercier - 810
6 It Is Easy to Determine Whether a Given Integer Is – Andrew Granville - 2005
12 It Is Easy to Determine Whether a Given Integer Is Prime – Andrew Granville - 2004
22 Primality testing using elliptic curves – Shafi Goldwasser, Joe Kilian - 1999
10 Integer Factorization – Daniel J. Bernstein - 2006
8 Reducing lattice bases to find small-height values of univariate polynomials – Daniel J. Bernstein - 2004
AN Õ(log2 (N)) TIME PRIMALITY TEST FOR GENERALIZED CULLEN NUMBERS – José María, Grau, Antonio M. Oller-marcén
Fast Primality Proving on Cullen Numbers – Tsz-wo Sze - 2009
3 Four primality testing algorithms – René Schoof - 2008
21 Smooth numbers: computational number theory and beyond – Andrew Granville - 2008
Uncertainty can be Better than Certainty: Some Algorithms for Primality Testing ∗ – Richard P. Brent - 2006
9 Sharpening PRIMES is in P for a large family of numbers – Pedro Berrizbeitia - 2005
Easy numbers for the Elliptic Curve Primality Proving Algorithm – F. Morain - 1992
162 Elliptic Curves And Primality Proving – A. O. L. Atkin, F. Morain - 1993
Modern Primality Tests and the Agrawal-Kayal-Saxena Algorithm – Jason Wojciechowski - 2003
Primality testing – Richard P. Brent - 2003
3 Primality testing – Richard P - 1992