ANT proceedings  table of contents
Surveys in algorithmic number theory
All files below have now appeared as part of the
book pictured above, albeit in a slightly different order than on this page.
[Introduction]

1. Hendrik Lenstra  Solving the Pell equation

2. Joe Buhler, Stan Wagon  Basic algorithms in number theory
[Factoring and primality]

3. Carl Pomerance  Smooth numbers and the quadratic sieve

4. Peter Stevenhagen  The number field sieve

5. René Schoof  Four primality testing algorithms
[surveys]

6. Hendrik Lenstra  Lattices

7. Bjorn Poonen  Elliptic Curves

8. Peter Stevenhagen  The arithmetic of number rings

9. Andrew Granville  Smooth numbers: computational number theory and
beyond

10. Dan Bernstein  Fast multiplication and its applications
[Further topics]

11. Carl Pomerance  Elementary Thoughts on Discrete Logarithms

12. Oliver Schirokauer  The impact of the number field sieve on the
discrete logarithm problem in finite fields

13. Dan Bernstein  Reducing lattice bases to find smallheight values
of univariate polynomials

14. René Schoof  Computing Arakelov class groups

15. Henri Cohen, Peter Stevenhagen  Computational Class Field Theory

16. Dan Bernstein  Protecting communications against forgery

17. Daqing Wan  Algorithmic Theory of Zeta Functions over Finite Fields

18. Alan Lauder, Daqing Wan  Counting points on varieties over finite fields
of small characteristic

19. Jaap Top, Noriko Yui  Congruent number problems and their
variants

20. William Stein  An introduction to computing modular
forms using modular symbols