Algorithmic Number Theory MSRI Publications Volume 44, 2008

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

397 421 447

viii

CONTENTS

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

497 535 551 579 613 641