Table of Contents
PDF file
Preface, ix-x
PDF file
Solving the Pell equation
by Hendrik W. Lenstra, Jr., 1-23
PDF file
Basic algorithms in number theory
by Joe Buhler and Stan Wagon, 25-68
PDF file
Smooth numbers and the quadratic sieve
by Carl Pomerance, 69-81
PDF file
The number field sieve
by Peter Stevenhagen, 83-100
PDF file
Four primality testing algorithms
by René Schoof, 101-126
PDF file
Lattices
by Hendrik W. Lenstra, Jr., 127-181
PDF file
Elliptic curves
by Bjorn Poonen, 183-207
PDF file
The arithmetic of number rings
by Peter Stevenhagen, 209-266
PDF file
Smooth numbers: computational number theory and beyond
by Andrew Granville, 267-323
PDF file
Fast multiplication and its applications
by Daniel J. Bernstein, 325-384
PDF file
Elementary thoughts on discrete logarithms
by Carl Pomerance, 385-396
PDF file
The impact of the number field sieve on the discrete logarithm problem in finite fields
by Oliver Schirokauer, 397-420
PDF file
Reducing lattice bases to find small-height values of univariate polynomials
by Daniel J. Bernstein, 421-446
PDF file
Computing Arakelov class groups
by René Schoof, 447-495
PDF file
Computational class field theory
by Henri Cohen and Peter Stevenhagen, 497-534
PDF file
Protecting communications against forgery
by Daniel J. Bernstein, 535-549
PDF file
Algorithmic theory of zeta functions over finite fields
by Daqing Wan, 551-578
PDF file
Counting points on varieties over finite fields of small characteristic
by Alan G. B. Lauder and Daqing Wan, 579-612
PDF file
Congruent number problems and their variants
by Jaap Top and Noriko Yui, 613-639
PDF file
An introduction to computing modular forms using modular symbols
by William A. Stein, 641-652
PDF file