Clay Mathematics Institute

Introductory Workshop on Algorithmic Number Theory

CDROM : Contents

Table of Contents

Hendrik Lenstra Solving Pell's Equation

Dan Bernstein Fast multiplication

Stan Wagon Computational Number Theory: Basic Algorithms

Jeffrey Shallit The complexity of Euclid's GCD algorithm

Carl Pomerance Smooth numbers and the quadratic sieve

Dan Bernstein Applications of fast multiplication

Bjorn Poonen Elliptic Curves 1

Stan Wagon Computational number theory: Subtler basic algorithms

Peter Stevenhagen Number field sieve

Dan Boneh RSA: Past, Present and Future (not available)

Carl Pomerance Primality

Hendrik Lenstra Lattices I

Jeffrey Shallit Algorithmic Number Theory Before Computers

Hendrik Lenstra Lattices II

Andrew Odlyzko Lattice basis reduction algorithms in cryptanalysis

Cynthia Dwork Positive Applications of Lattices to Cryptography (not available)

Dan Bernstein Protecting communications against forgery

Umesh Vazirani Quantum Computation

Rene Schoof Infrastructure

Bjorn Poonen Elliptic Curves II

Daqing Wan Zeta Functions over Finite Fields

Andrew Granville Smooth numbers 1

William Stein How to get your hands on modular forms using modular symbols

Rene Schoof Number field algorithms

Bjorn Poonen Elliptic curves 3

Andrew Granville Smooth numbers 2

Joe Buhler L-series in algorithmic number theory

Noriko Yui Congruent number problems in dimension one and two

Henri Cohen Computational class field theory

Order Form