It is easy to determine whether a given integer is prime

Bulletin of the American Mathematical Society

Volumn 42, Issue 1, 2005, Pages 3-38

  Granville, Andrew ^a  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 13544255689     PISSN: 02730979     EISSN: None     Source Type: Journal    
DOI: 10.1090/S0273-0979-04-01037-7     Document Type: Article

References (22)

1. Leonard M. Adleman and Ming-Deh A. Huang, Primality testing and abelian varieties over finite fields, Lecture Notes in Mathematics, vol. 1512, Springer-Verlag, Berlin. MR1176511 (93g:11128)
2. Leonard M. Adleman, Carl Pomerance and Robert S. Rumely, On distinguishing prime numbers from composite numbers, Annals of Mathematics 117 (1983), 173-206. MR0683806 (84e:10008)
3. Manindra Agrawal, Neeraj Kayal and Nitin Saxena, PRIMES is in P (to appear).
4. W. R. Alford, Andrew Granville and Carl Pomerance, There are infinitely many Carmichael numbers, Annals of Mathematics 139 (1994), 703-722. MR1283874 (95k:11114)
5. Roger C. Baker and Glynn Harman, The Brun-Titchmarsh Theorem on average, Progr. Math. 138 (1996), 39-103. MR1399332 (97h:11096)
6. D. J. Bernstein, Proving primality in essentially quartic random time (to appear).
7. Pedro Berrizbeitia, Sharpening "PRIMES is in P" for a large family of numbers (to appear).
8. Dan Boneh, Twenty years of attacks on the RSA Cryptosystem, Notices Amer. Math. Soc. 46 (1999), 203-213. MR1673760
9. Richard Crandall and Carl Pomerance, Prime numbers. A computational perspective, Springer-Verlag, New York, 2001. MR1821158 (2002a:11007)
10. Whitfield Diffie and Martin E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory 22 (1976), 644-654. MR0437208 (55:10141)
11. Etienne Fouvry, Théorème de Brun-Titchmarsh; application au théorème de Fermat, Invent. Math 79 (1985), 383-407. MR0778134 (86g:11052)
12. Dorian M. Goldfeld, On the number of primes p for which p + a has a large prime factor, Mathematika 16 (1969), 23-27. MR0244176 (39:5493)
13. Andrew Granville and Thomas Tucker, It's as easy as abc, Notices Amer. Math. Soc. 49 (2002), 1224-1231. MR1930670 (2003f:11044)
14. Shaft Goldwasser and Joe Kilian, Almost all primes can be quickly certified, Proceedings of the 18th annual ACM symposium on theory of computing, Association for Computing Machinery, New York, 1986.
15. Donald E. Knuth, The art of computer programming, volume 2: Seminumerical algorithms, Addison-Wesley, Reading, 1969. MR0286318 (44:3531)
16. H.W. Lenstra, Jr., Galois theory and primality testing, Lecture Notes in Mathematics 1142 (1985), 169-189. MR0812498 (87g:11171)
17. H.W. Lenstra, Jr., and Carl Pomerance, Primality testing with Gaussian periods (to appear).
18. Yu. V. Matijasevich, Hilbert's Tenth Problem, MIT Press, Cambridge, MA, 1993. MR1244324 (94m:03002b)
19. Preda Mihailescu and Roberto Avanzi, Efficient 'quasi - deterministic' primality test improving AKS (to appear).
20. Gérald Tenenbaum and Michel Mendès France, The Prime Numbers and Their Distribution, Student Mathematical Library 6 (2000), Amer. Math. Soc. MR1756233 (2001j:11086)
21. Paulo Ribenboim, The new book of prime number records, Springer-Verlag, New York, 1995. MR1377060 (96k:11112)
22. José Felipe Voloch, On some subgroups of the multiplicative group of finite rings (to appear).