Jon's research is in the area of algorithmic number theory, which is the
design, analysis, and implementation of computer algorithms to solve problems from number
theory. Some of the most important problems in this area are factoring large integers and
testing integers for primality. Perhaps the most important application for number
theoretic algorithms is in public-key cryptography. Jon has done joint work with Butler
students, and his research makes use of Butler's new supercomputer, the Big
Dawg.
