I am interested in computational number theory, which deals with
the computational aspect of number theory, such as factoring
large numbers(with application in crytoanalysis), primality proving, etc.
Preprints:
Square Products in Short Intervals
k-Semismooth Integers
Slides:
Smooth integers in short intervals and their product
In pdf format, produced with Latex and the prosper package. Here is a nice tutorial for prosper.
Recently (August 2002) several indian researchers discovered a deterministic
polynomial time algorithm for primality proving! See the following website
for details.
PRIMES is in P