11509 William Adams/Daniel Shanks: Strong primality tests that are not sufficient. Math. Comp. 39 (1982), 255-300. L. Adleman/M. Huang: Primality testing and abelian varieties over finite fields. SLN Math. 1512 (1992). 11506 Leonard Adleman/Carl Pomerance/Robert Rumely: On distinguishing prime numbers from composite numbers. Annals Math. 117 (1983), 173-206. 17713 Manindra Agrawal/Neeraj Kayal/Nitin Saxena: Primes is in P. Ann. Math. 160 (2004), 781-793. A. Atkin/F. Morain: Elliptic curves and primality proving. INRIA Rocquencourt, Rapp. Rech. 1256 (1990). 23052 Mohamed Ayad/Omar Kihel: Recognizing the primes using permutations. Int. J. Number Theory 8/8 (2012), 2045-2057. 20982 Annabell Berger: Der Primzahltest von Agrawal-Kayal-Saxena im Vergleich zum Primzahltest von Rabin-Miller. Bachelorarbeit Fernuniversität Hagen, 2004, 43p. 20978 Daniel Bernstein: Proving primality after Agrawal-Kayal-Saxena. Internet 2004, 15p. 17752 Folkmar Bornemann: Ein Durchbruch für jedermann. DMV Mitt. 2004/2, 14-21. On the primality test in P discovered by Agrawal, Kayal and Saxena. 3572 David Bressoud: Factorization and primality tests. Springer 1989. John Brillhart/D. H. Lehmer/John Selfridge: New primality criteria and factorizations of 2^m +/- 1. Math. Comp. 29/130 (1975), 620-647. 5814 Paolo Codeca'/Luciano Biasini/Gaetano Zanghirati: Implementazione di tests probabilistici di primalita'. Ann. Univ. Ferrara 38 (1992), 117-132. 11507 Henri Cohen/H. Lenstra: Primality testing and Jacobi sums. Math. Comp. 42 (1984), 297-330. 357 J. Dixon: Factorization and primality tests. Am. Math. Monthly 91 (1984), 333-352. S. Goldwasser/J. Kilian: Almost all primes can be quickly certified. Proc. 18th STOC (Berkeley) (1986), 316-329. 16676 Andrew Granville: It is easy to determine whether a given integer is prime. Bull. AMS 42/1 (2004), 3-38. A. Guthmann: Primzahltests und Pseudoprimzahlen. Bayreuther Math. Schr. 21 (1986), 101-116. 20980 Ian Kiming: Cryptography supplements. Internet 2008, 28p. Contains a proof of the AKS primality test. 8586 Evangelos Kranakis: Primality and cryptography. DM 50. 20979 H. Lenstra/Carl Pomerance: Primality testing with Gaussian periods. Internet 2005, 45p. Gary Miller: Riemann's hypothesis and tests for primality. J. Comp. Sys. Sci. 13 (1976), 300-317. F. Morain: Distributed Primality Proving and the primality of (2^{3539}+1)/3. Proc. EUROCRYPT'90, Springer LN Comp. Sci. 473 (1991), ... 7196 Helmut Mueller: Primzahltests und elliptische Kurven. 10^99+289 ist prim. Mitt. Math. Ges. Hamburg 13 (1993), 155-177. 7403 R. Pinch: Some primality testing algorithms. Notices AMS November 1993, ..., or Internet 1993, 12p. 358 Carl Pomerance: Very short primality proofs. Math. of Computation 48 (1987), 315-322. 20984 Carl Pomerance: Primality testing - variations on a theme of Lucas. Internet 2009, 9p. Carl Pomerance/R. Crandall: Primes. Springer 1999, 350p. 3-540-94777-9. DM 98. M. Rabin: Probabilistic algorithm for testing primality. J. Number Theory 12 (1980), 128-138. 17714 Sara Robinson: Fast deterministic algorithm for primality testing. History of the Agrawal-Kayal-Saxena primality test. 24892 Andrea Scarpante: On primality tests. Manuscript 2014, 50p. 20981 Rene' Schoof: Four primality testing algorithms. Internet 2008, 26p. Contains a proof of the AKS primality test. 22249 Terence Tao/Ernest Croot/Harald Helfgott: Deterministic methods to find primes. Math. Computation ... (2011), 14p. 20983 Tobias Tscheuschner: Der Primzahltest von Agrawal, Kayal und Saxena. Internet 2003, 9p. 14407 Johann Wiesenbauer: Primzahltests und Faktorisierungsalgorithmen I. IMN 186 (2001), 9-23. 5022 Juergen Wolfart: Primzahltests und Primfaktorzerlegung. 2687 Chatterji/, 161-188. Gaetano Zanghirati: Congruenze, classi di resti e tests probabilistici di primalita'. Tesi, Ferrara 1991.