Abstract:    We present an overview of the AKS algorithm for proving primality in polynomial time.  An implementation of a parallel version of this algorithm using existing university computer resources will be discussed.  This is a first step towards using grid technology to investigate computationally intensive number-theoretic problems.