Algorithmic Number Theory

Joe Buhler received his Ph.D. from Harvard University in 1977, writing a thesis on algebraic number theory. He has taught at the Pennsylvania State Universtiy, Harvard University, and Reed College, and served as the Deputy Director at the Mathematical Sciences Research Institute in Berkeley, California. His research interests include number theory, combinatorics, algebra, and algorithmic aspects of these fields. In addition to research papers and monographs he has written popular articles on mathematics, and the mathematics of juggling. He has served on various committees of the American Mathematical Society and the Mathematics Association of America, is an editor for several journals, and has organized several major conferences in number theory. Peter Stevenhagen obtained his PhD from the University of California at Berkeley in 1988. He was charge de recherche in the CNRS in Besancon, France before forming a small number theory group at the University of Amsterdam. Since 1993, he is the organizer of the biweekly Intercity Number Theory Seminar, the Dutch national platform for research in number theory. In 2000 he was appointed at Leiden University, the oldest university in the Netherlands, which was founded in 1575. Besides his research papers, his bibliography counts various papers in number theory of popularizing and historical nature. He is a member of the board of the Dutch Mathematical Society, the Wiskundig Genootschap.

• 1. Solving Pell's equation Hendrik Lenstra; 2. Basic algorithms in number theory Joe Buhler and Stan Wagon; 3. Elliptic curves Bjorn Poonen; 4. The arithmetic of number rings Peter Stevenhagen; 5. Fast multiplication and applications Dan Bernstein; 6. Primality testing Rene Schoof; 7. Smooth numbers: computational number theory and beyond Andrew Granville; 8. Smooth numbers and the quadratic sieve Carl Pomerance; 9. The number field sieve Peter Stevenhagen; 10. Elementary thoughts on discrete logarithms Carl Pomerance; 11. The impact of the number field sieve on the discrete logarithm problem in finite fields Oliver Schirokauer; 12. Lattices Hendrik Lenstra; 13. Reducing lattices to find small-height values of univariate polynomials Dan Bernstein; 14. Protecting communications against forgery Dan Bernstein; 15. Computing Arakelov class groups Rene Schoof; 16. Computational class field theory Henri Cohen and Peter Stevenhagen; 17. Zeta functions over finite fields Daqing Wan; 18. Counting points on varieties over finite fields Alan Lauder and Daqing Wan; 19. How to get your hands on modular forms using modular symbols William Stein; 20. Congruent number problems in dimension one and two Jaap Top and Noriko Yui.

Review of the hardback: '… can be warmly recommended to anyone interested in the fascinating area of computational number theory.' EMS Newsletter