17713 Manindra Agrawal/Neeraj Kayal/Nitin Saxena: Primes is in P. Ann. Math. 160 (2004), 781-793. 8498 Lennart Adleman/Kevin McCurley: Open problems in number theoretic complexity. Internet, ca. 1994, 32p. 22441 Bill Allombert: Theorie de Galois effective pour les corps de nombres et les corps finis. These Univ. Bordeaux I, 2001, 92p. J. Arndt/C. Haenel: Pi unleashed. Springer 2001, 270p. Eur 33. Eric Bach/Jeffrey Shallit: Algorithmic number theory I. MIT Press 1996, 510p. 0-262-02405-5. $55. 25917 David Bailey/Richard Crandall: On the random character of fundamental constant expansions. Exp. Math. 10/2 (2001), 175-190. 24190 Welleda Maria Baldoni/Carlo Ciliberto/Giulia Maria Piacentini Cattaneo: Aritmetica, crittografia, codici. Springer 2006, 520p. Eur 26. 7826 G. Batut/D. Bernardi/Henri Cohen/M. Olivier: User's guide to PARI-GP. Internet 1995, 168p. 25289 Karim Belabas: L'algorithmique de la theorie algebrique des nombres. Internet, 52p. Karim Belabas/Henri Cohen: Numerical algorithms for number theory - using Pari/GP. AMS 2021, 430p. Eur 129. 25952 Jonathan Borwein/David Bailey: Mathematics by experiments. Peters 2008, 380p. Eur 59. 25982 Jonathan Borwein/David Bailey/Roland Girgensohn: Experimentation in mathematics. Peters 2004, 350p. Eur 53. 19285 Richard Brent: Computer arithmetic - a programmer's perspective. Internet 1999, 7p. 23023 Richard Brent/Paul Zimmermann: Modern computer arithmetic. Internet 2010, 260p. 21008 David Bressoud/Stan Wagon: A course in computational number theory. Wiley 1999, 370p. Eur 46. J. Buchmann/J. Loho/J. Zayer: An implementation of the general number field sieve. Springer LN in Computer Sci. 773 (1994), 159-165. 5814 Paolo Codeca'/Luciano Biasini/Gaetano Zanghirati: Implementazione di tests probabilistici di primalita'. Ann. Univ. Ferrara 38 (1992), 117-132. 5235 Henri Cohen: A course in computational number algebraic number theory. Springer 2000, 540p. Eur 70. Henri Cohen: Advanced topics in computational number theory. Springer 1999. 3-540-98727-4. $60. 14472 Henri Cohen: Zahlentheoretische Aspekte der Kryptographie. Informatik-Spektrum Juni 2001, 129-139. 19112 Richard Crandall/Carl Pomerance: Prime numbers. Springer 2005, 600p. Eur 62. Thomas Denny/Volker Mueller: On the reduction of composed relations from the number field sieve. Algorithmic Number Theory Symposium II (1996), ... J. Dixon: The number of steps in the Euclidean algorithm. J. Number Theory 2 (1970), 414-422. B. Dodson/Arjen Lenstra: NFS with four large primes. An explosive experiment. Springer LN Comp. Sci. 963 (1995), 372-385. R. Elkenbracht-Huizing: An implementation of the number field sieve. Experimental Math., ca. 1996. 22823 Steven Finch: The miracoulous Bailey-Borwin-Plouffe pi algorithm. Internet 1997, 5p. 16015 Otto Forster: Algorithmische Zahlentheorie. Vieweg 1996, 280p. Eur 33. Walter Gautschi (ed.): Proc. of Symposia in Applied Mathematics. Mathematics of Computation 1943-1993, Vancouver 1993. 5493 Peter Giblin: Primes and programming. Cambridge UP 1993, 250p. 0-521-40988-8. Pds. 13. R. Golliver/Arjen Lenstra/K. McCurley: Lattice sieving and trial division. Springer LN Comp. Sci. 877 (1994), 18-27. Dan Gordon: Discrete logarithms in GF(p) using the number field sieve. SIAM J. Discrete Math. 6 (1993), 124-138. 25974 Hans-Gert Gräbe: Algebraic numbers in symbolic computation. Internet 1999, 15p. 25198 Michael Jacobson: Computational techniques in quadratic fields. Master thesis Univ. Manitoba 1995, 160p. Arjen Lenstra/K. Lenstra: The development of the number field sieve. Springer 1993. 24221 Victor Moll: Numbers and functions. AMS 2012, 500p. Eur 46. Peter Montgomery: Square roots of products of algebraic numbers. In Gautschi 1993, ... Peter Montgomery: A block Lanczos algorithm for finding dependencies over GF(2). Springer LN Comp. Sci. 921 (1995), 106-120. 3548 Attila Pethoe/Michael Pohst/Hugh Williams/Horst Zimmer (ed.): Computational number theory. De Gruyter 1991. 4711 Clifford Pickover: Mit den Augen des Computers. Markt & Technik 1992. Richard Pinch: Computational number theory. Cambridge UP 2000. 26532 David Platt: Numerical computations concerning the GRH. Math. Comput. ... (2016), 19p. M. Pohst: Computational algebraic number theory. Birkhaeuser 1993, 140p. 3-7643-2913-0. DM 44. 2210 M. Pohst/H. Zassenhaus: Algorithmic algebraic number theory. Cambridge UP 1990. [= 1997, 500p. $40 (pb.)] J. Pollard: The lattice sieve. In Lenstra/Lenstra 1993, 43-49. 22559 Carl Pomerance: Computational number theory. In 21630 Gowers/, 348-362. 21058 Jörg Richstein: Segmentierung und Optimierung von Algorithmen zu Problemen aus der Zahlentheorie. Diss. Univ. Gießen 1999, 170p. 23716 Fernando Rodriguez Villegas: Experimental number theory. Oxford UP 2007, 210p. Eur 32. 7257 Katia Sangiorgi: Algoritmi in C++ per l'aritmetica di grandi numeri interi. Tesi, Ferrara 1995. Oliver Schirokauer: Discrete logarithms and local units. Phil. Trans. Royal Soc. London 345 (1993), 409-423. 25915 Katja Schmidt-Samoa: Das Number-Field-Sieve. Diplomarbeit Univ. Kaiserslautern 2002, 140p. 25916 Katja Schmidt-Samoa: A new Rabin-type trapdoor permutation equivalent to factoring and its applications. Internet ca. 2007, 18p. 6764 Arnold Schoenhage/Andreas Grotefeld/Ekkehard Vetter: Fast algorithms. Bibl. Inst. 1994, 300p. 3-411-16891-9. DM 68. Etwa 160 Programme fuer ganze Zahlen und Polynome in beliebiger und garantierter Genauigkeit. 16893 Raymond Seroul: Programming for mathematicians. Springer 2000, 430p. Eur 37. 25980 Jeffrey Shallit: Review of the books "Mathematics by experiment" and "Experimentation in mathematics" by Jonathan Borwein a.o. Notices AMS September 2005, 863-865. 22554 Victor Shoup: A computational introduction to number theory and algebra. Internet 2008, 600p. 26792 Gernot Stania/Gerhard Paulus: Zahlentheorie mit dem Interferenzcomputer. Physik-Journal 7/5 (2008), 16-17. 23661 William Stein: An explicit approach to elementary number theory. Harvard Univ. 2001, 160p. Damian Weber: An implementation of the general number field sieve to compute discrete logarithms mod p. Adv. Cryptology - Eurocrypt '95 (1995), 95-105. Damian Weber: Computing discrete logarithms with the number field sieve. Algorithmic Number Theory Symposium II (1996), ... Song Yan: Number theory for computing. Springer 2000. $46. Hans Zassenhaus: Zahlentheoretische Experimente im Unterricht. Funktionalanalysis, Approximationstheorie, Numerische Mathematik: Oberwolfach Juni und November 1965 (1967), 104-108. Joerg Zayer: Faktorisieren mit dem Number field sieve. Dissertation, Univ. Saarbruecken 1995. 25920 Doron Zeilberger: Review of the books "Mathematics by experiments" and "Experimentation in mathematics" by Borwein, Bailey and Girgensohn. Internet 2004, 2p.