Primality testing with Gaussian periods (2003)

Cached

Download Links

by H. W. Lenstra , Carl Pomerance
Citations:21 - 1 self

Documents Related by Co-Citation

18 Proving primality in essentially quartic random time – Daniel J. Bernstein - 2003
132 Prime numbers: a computational perspective – R Crandall, C Pomerance - 2005
27 Implementing the asymptotically fast version of the elliptic curve primality proving algorithm – F. Morain, Of P. Berrizbeitia, D. Bernstein, P. Mihăilescu, R. Mocenigo
107 On distinguishing prime numbers from composite numbers – L M Adleman, C Pomerance, R S Rumely - 1983
69 Almost All Primes Can be Quickly Certified – Shafi Goldwasser, Joe Kilian
190 Probabilistic algorithm for testing primality – M O Rabin - 1980
170 Elliptic curves over finite fields and the computation of square roots mod p – R Schoof - 1985
917 A Course in Computational Algebraic Number Theory. Springer-Verlag Graduate Texts in Mathematics – Henri Cohen - 1993
8 Cyclotomic primality proving — Recent developments – P Mihăilescu - 1998
162 Elliptic Curves And Primality Proving – A. O. L. Atkin, F. Morain - 1993
8 Efficient quasi-deterministic primality test improving AKS – R M Avanzi, P Mihăilescu
207 Riemann’s hypothesis and tests for primality – G L Miller - 1976
233 Factoring integers with elliptic curves – H W Lenstra - 1987
82 Counting Points on Elliptic Curves Over Finite Fields – René Schoof, Par Ren E Schoof - 1995
296 Approximate formulas for some functions of prime numbers – J Rosser, L Schoenfeld - 1962
33 The complexity of class polynomial computation via floating point approximations. ArXiv preprint – Andreas Enge - 601
8 Primality proving using elliptic curves: An update – F. Morain - 1998
541 A classical introduction to modern number theory, Second edition, Graduate texts in mathematics – K Ireland, M Rosen - 1990
22 Primality testing using elliptic curves – Shafi Goldwasser, Joe Kilian - 1999