Computational Number Theory (CNT) may loosely be defined as the use of computational techniques to answer questions in Number Theory, or to gain insights into how questions may be answered by a theoretical approach. Number Theory itself may be described as the mathematical treatment of the properties and relationships between integers. The concept "integer" has become rather more general over the past few centuries.

Number Theory is a big subject, and even CNT is rather large, so
everyone specializes to some extent. My interests are primarily integer factorization and
primality testing. Number Theory used to be
completely useless but, since the invention of public key cryptography in the
1970's, it's now reached the stage where small sums of money can be earned by
factoring large integers, and *extremely* large sums of money are protected
by integers which are supposedly impossible to factor.

Somewhere around here, if you're very lucky, you may find some miscellanea and curios. Enjoy!