Algorithmic Number Theory

MSRI Publications
Volume 44, 2008

Contents

Preface page ix
Solving the Pell equation 1
H ENDRIK W. L ENSTRA , J R .
Basic algorithms in number theory 25
J OE B UHLER AND S TAN WAGON
Smooth numbers and the quadratic sieve 69
C ARL P OMERANCE
The number field sieve 83
P ETER S TEVENHAGEN
Four primality testing algorithms 101
R EN É S CHOOF
Lattices 127
H ENDRIK W. L ENSTRA , J R .
Elliptic curves 183
B JORN P OONEN
The arithmetic of number rings 209
P ETER S TEVENHAGEN
Smooth numbers: computational number theory and beyond 267
A NDREW G RANVILLE
Fast multiplication and its applications 325
DANIEL J. B ERNSTEIN
Elementary thoughts on discrete logarithms 385
C ARL P OMERANCE
The impact of the number field sieve on the discrete logarithm problem in finite
fields 397
O LIVER S CHIROKAUER
Reducing lattice bases to find small-height values of univariate polynomials 421
DANIEL J. B ERNSTEIN
Computing Arakelov class groups 447
R EN É S CHOOF

vii
viii CONTENTS

Computational class field theory 497

H ENRI C OHEN AND P ETER S TEVENHAGEN
Protecting communications against forgery 535
DANIEL J. B ERNSTEIN
Algorithmic theory of zeta functions over finite fields 551
DAQING WAN
Counting points on varieties over finite fields of small characteristic 579
A LAN G. B. L AUDER AND DAQING WAN
Congruent number problems and their variants 613
JAAP T OP AND N ORIKO Y UI
An introduction to computing modular forms using modular symbols 641
W ILLIAM A. S TEIN