Future directions in algorithmic number theory

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.

1. Lecture Notes
1. Agrawal: Primality Testing
2. Agrawal: Finding Quadratic Nonresidues
3. Bernstein: Proving Primality After Agrawal-Kayal-Saxena
4. Edixhoven: Point Counting
5. Gao: Factoring Polynomials under GRH
6. Kedlaya: Counting Points using p-adic Cohomology
7. Lauder: Counting Points over Finite Fields
8. Lenstra: Primality Testing with Pseudofields
9. Pomerance and Bleichenbacher: Constructing Finite Fields
10. Silverberg: Applications of Algebraic Tori to Crytography
11. Stein: Modular Forms Database
12. Voloch: Multiplicative Subgroups of a Finite Field
13. Wan: Partial Counting of Rational Points over Finite Fields
2. Problems
1. Remarks on Agrawal's Conjecture