This web page highlights some of the conjectures and open problems concerning Future directions in algorithmic number theory.

If you would like to print a hard copy of the whole outline, you can download a dvi, postscript or pdf version.

- Lecture Notes
- Agrawal: Primality Testing
- Agrawal: Finding Quadratic Nonresidues
- Bernstein: Proving Primality After Agrawal-Kayal-Saxena
- Edixhoven: Point Counting
- Gao: Factoring Polynomials under GRH
- Kedlaya: Counting Points using p-adic Cohomology
- Lauder: Counting Points over Finite Fields
- Lenstra: Primality Testing with Pseudofields
- Pomerance and Bleichenbacher: Constructing Finite Fields
- Silverberg: Applications of Algebraic Tori to Crytography
- Stein: Modular Forms Database
- Voloch: Multiplicative Subgroups of a Finite Field
- Wan: Partial Counting of Rational Points over Finite Fields
- Problems